Near-optimal fully-dynamic graph connectivity

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn , Issue , 2000, Pages 343-350

  Thorup, Mikkel ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AMORTIZED TIME; BICONNECTIVITY; CONNECTIVITY ALGORITHMS; GRAPH CONNECTIVITY; GRAPH PROBLEMS; LOWER BOUNDS; POINTER MACHINES; TIME COMPLEXITY;

ALGORITHMS; OPTIMIZATION; COMPUTATIONAL COMPLEXITY; RANDOM PROCESSES;

COMPUTATION THEORY; GRAPH THEORY;

FULLY-DYNAMIC GRAPH CONNECTIVITY;

EID: 0033708138     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335305.335345     Document Type: Conference Paper

References (10)

1. D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig. Sparsification - a technique for speeding up dynamic graph algorithms. J. ACM, 44( 5): 669-696, 1997. See also FOCS'92.
2. G. N. Frederickson. Data structures for on-line updating of minimum spanning trees, with applications. SIAM J. Comp., 14( 4): 781-798, 1985. See also STOC'83.
3. M. Fredman and M. Henzinger. Lower bounds for fully dynamic connectivity problems in graphs. Algorithmica, 22(3):351-362, 1998. (Pubitemid 128664720)
4. M. R. Henzinger and V. King. Randomized dynamic graph algorithms with polylogarithmic time per operation. In Proc. 27th STOC, pages 519-527, 1995.
5. M. R. Henzinger and M. Thorup. Sampling to provide or to bound: With applictions to fully dynamic graph algorithms. Rand. Struct. Algor., 11: 369-379, 1997. See also ICALP'96.
6. J. Holm, K. de Lichtenberg, and M. Thorup. Polylogarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity. In Proc. 30th STOC, pages 79-89, 1998.
7. P. B. Miltersen, S. Subramanian, J. S. Vitter, and R. Tamassia. Complexity models for incremental computation. Theor. Comp. Sc., 130( 1): 203-236, 1994.
8. D. Sleator and R. Tarjan. A data structure for dynamic trees. J. Comp. Syst. Sc., 26( 3): 362-391, 1983. See also STOC'81.
9. R. E. Tarjan. Efficiency of a good but not linear set union algorithms. J. ACM, 22: 215-225, 1975.
10. M. Thorup. Decremental dynamic connectivity. In Proc. 8th SODA, pages 305-313, 1997.