Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

Journal of the ACM

Volumn 48, Issue 4, 2001, Pages 723-760

  Holm, Jacob ^a,c   De Lichtenberg, Kristian ^a,c   Thorup, Mikkel ^b  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

^b AT AND T LABS RESEARCH   (United States)

^c Shannon Laboratory ^*  (Denmark)

Author keywords

2 edge connectivity; Biconnectivity; Connectivity; Dynamic graph algorithms; Minimum spanning tree

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DATA STRUCTURES; GRAPH THEORY; MATHEMATICAL OPERATORS; PROBLEM SOLVING;

2-EDGE CONNECTIVITY; BICONNECTIVITY; DYNAMIC GRAPH ALGORITHM; MINIMUM SPANNING TREE;

TREES (MATHEMATICS);

EID: 0012532065     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/502090.502095     Document Type: Article

References (32)

1. ALSTRUP, S., HOLM, J., DE LICHTENBERG, K., AND THORUP, M. 1997. Minimizing diameters of dynamic trees. In Proceedings of the 24th International Colloquium on Automata Languages and Programming (ICALP). Lecture Notes in Computer Science, vol. 1256. Springer-Verlag, New York, pp. 270-280.
2. BIEDL, T. C., BOSE, P., DEMAINE, E. D., AND LUBIW, A. 2001. Efficient algorithms for Petersen's matching theorem. J. Algorithms 38, 110-134.
3. 2) barrier. In Proceedings of the 41st IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 381-389.
4. EPPSTEIN, D. 1995. Dynamic euclidean minimum spanning trees and extrema of binary functions. Disc. Comput. Geom. 13, 237-250.
5. EPPSTEIN, D., GALIL, Z., ITALIANO, G. F., AND NISSENZWEIG, A. 1997. Sparsification - A technique for speeding up dynamic graph algorithms. J. ACM 44, 5, 669-696. (Announced at FOCS, 1992.)
6. FEDER, T., AND MIHAIL, M. 1992. Balanced matriods. In Proceedings of the 24th Annual ACM Symposium on the Theoi-y of Computing (STOC) (Victoria, B. C., Canada, May). ACM, New York, pp. 26-38.
7. FREDERICKSON, G. N. 1985. Data structures for on-line updating of minimum spanning trees, with applications. SIAM J. Comput. 14, 4, 781-798. (Announced at STOC, 1983.)
8. FREDERICKSON, G. N. 1997. Ambivalent data structures for dynamic 2-Edge-Connectivity and k smallest spanning trees. SIAM J. Comput. 26, 2 (Apr.), 484-538. (Announced at FOCS, 1991.)
9. FREDERICKSON, G. N., AND SRINIVAS, M. A. 1989. Algorithms and data structures for an expanded family of matroid intersection problems. SIAM J. Comput. 18, 1, 113-139.
10. FREDMAN, M., AND HENZINGER, M. R. 1998. Lower bounds for fully dynamic connectivity problems in graphs. Algorithmica 22, 3, 351-362.
11. GABOW, H. N., KAPLAN, H., AND TARJAN, R. E. 2001. Unique maximum matching algorithms. J. Algorithms, to appear.
12. HENZINGER, M. R. 1995. Fully dynamic biconnectivity in graphs. Algorithmica 13, 6, 503-538. (Announced at FOCS, 1992.)
13. HENZINGER, M. R. 2000. Improved data structures for fully dynamic biconnectivity. SIAM J. Comput. 29, 6, 1761-1815. (Announced at STOC, 1994.)
14. HENZINGER, M. R., AND KING, V. 1995. Fully dynamic biconnectivity and transitive closure. In Proceedings of the 36th IEEE Symposium on the Foundations of Computer Science (FOCS). IEEE Computer Society Press, Los Alamitos, Calif., pp. 664-672.
15. HENZINGER, M. R., AND KING, V. 1997a. Fully dynamic 2-edge connectivity algorithm in polygarithmic time per operation. Tech. Rep. SRC 1997-004a, Digital.
16. HENZINGER, M. R., AND KING, V. 1997b. Maintaining minimum spanning trees in dynamic graphs. In Proceedings of the 24th International Colloquium on Automata, Languages, and Programming (ICALP). Lecture Notes in Computer Science, vol. 1256. Springer-Verlag, New York, pp. 594-604.
17. HENZINGER, M. R., AND KING, V. 1999. Randomized fully dynamic graph algorithms with polylogarithmic time per operation. J. ACM 46, 4 (July), 502-536. (Announced at STOC, 1995.)
18. HENZINGER, M. R., KING, V., AND WARNOW, T. 1999. Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology. Algorithmica 24, 1, 1-13.
19. HENZINGER, M. R., AND LA POUTRE, H. 1995. Certificates and fast algorithms for biconnectivity in fully-dynamic graphs. In Proceedings of the 3rd European Symposium on Algorithms (ESA). Lecture Notes in Computer Science, vol. 979. Springer-Verlag, New York, pp. 171-184.
20. HENZINGER, M. R., AND THORUP, M. 1997. Sampling to provide or to bound: With applictions to fully dynamic graph algorithms. Rando. Struct. Algorithms 11, 369-379. (Announced at ICALP, 1996.)
21. HOLM, J., DE LICHTENBERO, K., AND THORUP, M. 1998. Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (Dallas, Tex., May 23-26). ACM, New York, pp. 79-89.
22. IYER, R. D., KARGER, D., RAHUL, H. S., AND THORUP, M. 2000. An experimental study of polylogarithmic fully-dynamic connectivity algorithms. In Proceedings of the 2nd Workshop on Algorithms Engineering and Experiments (ALENEX).
23. KING, V. 1999. Fully dynamic algorithms for maintaining all-pairs shortest paths and transitive closure in digraphs. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 81-89.
24. MlLTERSEN, P. B., SUBRAMANIAN, S., VITTER, J. S., AND TAMASSIA, R. 1994. Complexity models for incremental computation. Theoret. Comput. Sci. 130, 1, 203-236.
25. SLEATOR, D., AND TARJAN, R. E. 1983. A data structure for dynamic trees. J. Comput. Syst. Sci. 26, 3, 362-391. (Announced at STOC, 1981.)
26. SLEATOR, D., AND TARJAN, R. E. 1985. Biased search trees. SIAM J. Comput. 14, 3, 545-568.
27. TARJAN, R. E. 1975. Efficiency of a good but not linear set union algorithms. J. ACM 22, 2 (Apr.), 215-225.
28. TARJAN, R. E. 1983. Data Stuctures and Network Algorithms. SIAM, Philadelphia, Pa.
29. THORUP, M. 1999. Decremental dynamic connectivity. J. Algorithms 33, 229-243. (Announced at SODA, 1997.)
30. THORUP, M. 2000. Near-optimal fully-dynamic graph connectivity. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (Portland, Ore., May 21-23). ACM, New York, pp. 343-350.
31. THORUP, M., AND KARGER, D. 2000. Dynamic graph algorithms with applications (invited talk). In Proceedings of the 7th Scandinavian Workshop on Algorithms Theory (SWAT), Lecture Notes in Computer Science, vol. 1851. Springer-Verlag, New York, pp. 1-9.
32. WESTBROOK, J., AND TARJAN, R. E. 1992. Maintaining bridge-connected and biconnected components on-line. Algorithmica 7, 433-464.