142 search results - page 1 / 29 » Augmenting the connectivity of geometric graphs |
98
Voted
ENDM
2008
14 years 10 months ago
2008
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
88
Voted
COMGEO
2008
ACM
14 years 10 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 ...
58
Voted
SWAT
2000
Springer
15 years 1 months ago
2000
Springer
91
Voted
WADS
2007
Springer
15 years 4 months ago
2007
Springer
Connectivity augmentation problems ask for adding a set of at most k edges whose insertion makes a given graph satisfy a specified connectivity property, such as bridge-connectivi...
ORL
2008
14 years 10 months ago
2008
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a sp...