Maintaining minimum spanning forests in dynamic graphs

SIAM Journal on Computing

Volumn 31, Issue 2, 2001, Pages 364-374

  Henzinger, Monika R ^a   King, Valerie ^b  

^a GOOGLE INC   (United States)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Data structure; Dynamic graph; Graph algorithm; Minimum spanning tree

Indexed keywords

ALGORITHMS; DATA STRUCTURES; PROBLEM SOLVING; QUERY LANGUAGES; THEOREM PROVING; TREES (MATHEMATICS);

DYNAMIC GRAPHS;

COMPUTATIONAL COMPLEXITY;

EID: 0036253382     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539797327209     Document Type: Article

References (14)

1. T. CORMEN, C. LEISERSON, AND R. RIVEST, Introduction to Algorithms, MIT Press, Cambridge, MA, 1989, pp. 381-399.
2. D. EPPSTEIN, Dynamic Euclidean minimum spanning trees and extrema of binary functions, Discrete. Comput. Geom., 13 (1995), pp. 111-122.
3. D. EPPSTEIN, Z. GALIL, AND G. F. ITALIANO, Improved Sparsification, Tech. Report 93-20, Department of Information and Computer Science, University of California, Irvine, CA.
4. D. EPPSTEIN, Z. GALIL, G. F. ITALIANO, AND A. NISSENZWEIG, Sparsification - A technique for speeding up dynamic graph algorithms, J. ACM, 44 (1997), pp. 669-696.
5. S. EVEN AND Y. SHILOACH, An on-line edge-deletion problem, J. ACM, 28 (1981), pp. 1-4.
6. T. FEDER AND M. MIHAIL, Balanced matroids, in Proceedings of the 24th ACM Symposium on Theory of Computing, ACM Press, New York, 1992, pp. 26-38.
7. G. N. FREDERICKSON, Data structures for on-line updating of minimum spanning trees, SIAM J. Comput., 14 (1985), pp. 781-798.
8. G. N. FREDERICKSON AND M. A. SRINIVAS, Algorithms and data structures for an expanded family of matroid intersection problems, SIAM J. Comput., 18 (1989), pp. 112-138.
9. M. R. HENZINGER AND V. KING, Randomized dynamic graph algorithms with polylogarithmic time per operation, J. ACM, 46 (1999), pp. 502-516.
10. M. R. HENZINGER AND M. THORUP, Improved sampling with applications to dynamic graph algorithms, in Proceedings of the 23rd International Colloquium on Automata, Languages, and Programming (ICALP), Lecture Notes in Comput. Sci. 1099, Springer-Verlag, New York, 1996, pp. 290-299.
11. K. MEHLHORN, Data Structures and Algorithms 1; Sorting and Searching, Springer-Verlag, 1984.
12. H. NAGAMOCHI AND T. IBARAKI, Linear time algorithms for finding a sparse k-connected spanning subgraph of a k-connected graph, Algorithmica, 7 (1992), pp. 583-596.
13. D. D. SLEATOR, R. E. TARJAN, A data structure for dynamic trees, J. Comput. System Sci., 24 (1983), pp. 362-381.
14. R. E. TARJAN, Data Structures and Network Algorithms, SIAM, Philadelphia, 1983, p. 71.