142 search results - page 2 / 29 » Augmenting the connectivity of geometric graphs |
DIALM
2008
ACM
13 years 7 months ago
2008
ACM
A random geometric graph G(n, r) is a graph resulting from placing n points uniformly at random on the unit area disk, and connecting two points iff their Euclidean distance is at ...
ISAAC
2009
Springer
13 years 11 months ago
2009
Springer
It is shown that if a planar straight line graph (PSLG) with n vertices in general position in the plane can be augmented to a 3-edge-connected PSLG, then 2n−2 new edges are enou...
CATS
2007
13 years 6 months ago
2007
IPCO
2001
13 years 6 months ago
2001
CCCG
2010
13 years 6 months ago
2010
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming...