213 search results - page 24 / 43 » Maintaining Minimum Spanning Trees in Dynamic Graphs |
150
click to vote
CCCG
2010
15 years 5 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...
146
click to vote
INFOCOM
1999
IEEE
15 years 8 months ago
1999
IEEE
We present, prove correctness for, and evaluate a protocol for the reliable broadcast of topology and link-state information in a multihop communication network with a dynamic topo...
147
click to vote
SIAMCOMP
1998
15 years 3 months ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
156
click to vote
CCCG
2003
15 years 5 months ago
2003
We consider the problem of designing a transportation network to allow the residents of the network to avail service provided by a single facility whose location is predetermined....
105
click to vote
ICPR
2006
IEEE
16 years 5 months ago
2006
IEEE
Graph-Spectral surface integration techniques construct an integration path assuming that the surface contains a path along which the integration error is minimal. This paper pres...