36 search results - page 3 / 8 » Independence Free Graphs and Vertex Connectivity Augmentatio... |
165
click to vote
ISAAC
2007
Springer
15 years 11 months ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
170
click to vote
APPROX
2009
Springer
16 years 1 days ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...
173
click to vote
SIAMDM
2010
15 years 3 months ago
2010
A set of vertices C in a graph is convex if it contains all vertices which lie on shortest paths between vertices in C. The convex hull of a set of vertices S is the smallest conve...
179
click to vote
MFCS
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Bidimensionality provides a tool for developing subexponential fixed-parameter algorithms for combinatorial optimization problems on graph families that exclude a minor....
133
click to vote
COCOON
2009
Springer
16 years 12 hour ago
2009
Springer
It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...