Randomized fully dynamic graph algorithms with polylogarithmic time per operation

Journal of the ACM

Volumn 46, Issue 4, 1999, Pages 502-516

  Henzinger, Monika R ^a,b   King, Valerie ^a,b  

^a GOOGLE INC   (United States)

^b UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Connectivity; Dynamic graph algorithms

Indexed keywords

BIPARTITE GRAPHS; CONNECTIVITY; DYNAMIC GRAPH ALGORITHMS;

ALGORITHMS; APPROXIMATION THEORY; COMPUTER SCIENCE; DATA STRUCTURES; GRAPH THEORY; PROBLEM SOLVING;

RANDOM PROCESSES;

EID: 0000538343     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/320211.320215     Document Type: Article

References (21)

1. ALBERTS, D., AND HENZINGER, M. R. 1998. Average case analysis of dynamic graph algorithms. Algorithmica 20, 1, 32-60.
2. EPPSTEIN, D., GALIL, Z., ITALIANO, G. F., AND NISSENZWEIG, A. 1997. Sparsification-A technique for speeding up dynamic graph algorithms. J. ACM 44, 5 (Sept.), 669-696.
3. EPPSTEIN, D., GALIL, Z., ITALIANO, G. F., AND SPENCER, T. 1996. Separator based sparsification for dynamic planar graph algorithms. J. Comput. Syst. Sci. 52, 1, 3-27.
4. EPPSTEIN, D., ITALIANO, G. F., TAMASSIA, R., TARJAN, R. E., WESTBROOK, J., AND YUNG, M. 1992. Maintenance of a minimum spanning forest in a dynamic planar graph. In J Algorithms 13, 33-54.
5. EVEN, S., AND SHILOACH, Y. 1981. An on-line edge-deletion problem. J. ACM 28, 1 (Jan.), 1-4.
6. FREDERICKSON, G. N. 1985. Data structures for on-line updating of minimum spanning trees. SIAM J. Comput. 14, 781-798.
7. FREDERICKSON, G. N. 1997. Ambivalent Data Structures for Dynamic 2-Edge-connectivity and k Smallest Spanning Trees. SIAM J. Comput. 26, 2, 484-538.
8. GALIL, Z., AND ITALIANO, G. F. 1992. Fully dynamic algorithms for 2-edge connectivity. SIAM J. Comput. 21, 1047-1069.
9. HENZINGER, M. R. 1995. Fully dynamic biconnectivity in graphs. Algorithmica 13, 503-538.
10. HENZINGER, M. R. 1999. Improved data structures for fully dynamic biconnectivity in graphs. SIAM J. Comput., to appear.
11. HENZINGER, M. R. 1994. Fully dynamic cycle-equivalence in graphs. In Proceedings of the 35th Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 744-755.
12. HENZINGER, M. R., AND FREDMAN, M. L. 1998. Lower bounds for fully dynamic connectivity problems in graphs. Algorithmica 22, 351-362.
13. HENZINGER, M. R., AND LA POUTRE, H. 1995. Sparse certificates for dynamic biconnectivity in graphs. In Proceedings of the 3rd European Symposium on Algorithms. Springer-Verlag, Berlin, Germany, pp. 171-184.
14. HENZINGER, M. R., AND THORUP, M. 1997. Improved sampling with applications to dynamic graph algorithms. Rand. Struct. Algor. 11, 4, 369-379.
15. HOLM, J., DE LICHTENBERG, 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 Symposium on Theory of Computing (Dallas, Tex., May 23-26). ACM, New York, pp. 79-89.
16. MILTERSEN, P. B., SUBRAMANIAN, S., VITTER, J. S., AND TAMASSIA, R. 1994. Complexity models for incremental computation. Theoret. Comput. Science 130, 203-236.
17. NAGAMOCHI, H., AND IBARAKI, T. 1992. Linear time algorithms for finding a sparse k-connected spanning subgraph of a k-connected graph. Algorithmica 7, 583-596.
18. SLEATOR, D. D., AND TARJAN, R. E. 1983. A data structure for dynamic trees. J. Comput. Syst. Sci. 24, 362-381.
19. SPIRA, P. M., AND PAN, A. 1975. On finding and updating spanning trees and shortest paths. SIAM J. Comput. 4, 375-380.
20. TARJAN, R. E., AND VISHKIN, U. 1985. An efficient parallel biconnectivity algorithm. SIAM J. Comput. 14, 862-874.
21. WESTBROOK, J., AND TARJAN, R. E. 1989. Amortized analysis of algorithms for set union with backtracking. SIAM J. Comput. 18, 1-11.