310 search results - page 30 / 62 » dam 2008 |
112
Voted
DAM
2008
15 years 3 months ago
2008
For a graph G, it is known to be a hard problem to compute the competition number k(G) of the graph G in general. In this paper, we give an explicit formula for the competition nu...
122
click to vote
DAM
2008
15 years 3 months ago
2008
We present a polynomial time algorithm to compute a minimum (weight) feedback vertex set for AT-free graphs, and extending this approach we obtain a polynomial time algorithm for ...
102
click to vote
DAM
2008
15 years 3 months ago
2008
The Newton Bracketing method [9] for the minimization of convex functions f : Rn R is extended to affinely constrained convex minimization problems. The results are illustrated for...
106
click to vote
DAM
2008
15 years 3 months ago
2008
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
101
click to vote
DAM
2008
15 years 3 months ago
2008
For each constant k, we present a linear time algorithm that, given a planar graph G, either finds a minimum odd cycle vertex transversal in G or guarantees that there is no transv...