11 search results - page 2 / 3 » On shredders and vertex connectivity augmentation |
COMGEO
2008
ACM
13 years 7 months ago
2008
ACM
Let G be a connected plane geometric graph with n vertices. In this paper, we study bounds on the number of edges required to be added to G to obtain 2-vertex or 2-edge connected ...
ESA
2005
Springer
14 years 29 days ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
COMGEO
2008
ACM
13 years 7 months ago
2008
ACM
Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton, we can always find a vertex in one component that s...
IPL
2007
13 years 7 months ago
2007
For a given connected graph G of order n, a routing R in G is a set of n(n − 1) elementary paths specified for every ordered pair of vertices in G. The vertex (resp. edge) forw...
MFCS
2004
Springer
14 years 24 days 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....