213 search results - page 1 / 43 » Maintaining Minimum Spanning Trees in Dynamic Graphs |
ICALP
1997
Springer
13 years 9 months ago
1997
Springer
SOFSEM
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We consider the problem of maintaining a minimum spanning tree within a graph with dynamically changing edge weights. An online algorithm is confronted with an input sequ...
ESA
2000
Springer
13 years 8 months ago
2000
Springer
Given a 2-node connected, undirected graph G = (V, E), with n nodes and m edges with real weights, and given a minimum spanning tree (MST) T = (V, ET ) of G, we study the problem o...
INFOVIS
2003
IEEE
13 years 10 months ago
2003
IEEE
Network evolution is a ubiquitous phenomenon in a wide variety of complex systems. There is an increasing interest in statistically modeling the evolution of complex networks such...
SODA
1994
ACM
13 years 6 months ago
1994
ACM
We maintain the maximum spanning tree of a planar point set, as points are inserted or deleted, in O(log3 n) time per update in Mulmuley's expected-case model of dynamic geom...