Decremental Dynamic Connectivity

Journal of Algorithms

Volumn 33, Issue 2, 1999, Pages 229-243

  Thorup, Mikkel ^a  

^a AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000559410     PISSN: 01966774     EISSN: None     Source Type: Journal    
DOI: 10.1006/jagm.1999.1033     Document Type: Article

References (17)

1. A. V. Aho, Y. Sagiv, T. G. Szymanski, and J. D. Ullman, Inferring a tree from lowest common ancestors with an application to the optimization of relational expressions, SIAM J. Comput. 10, No. 3 (1981), 405-421.
2. S. Alstrup, J. P. Secher, and M. Spork, Optimal on-line decremental connectivity in trees, Inform. Process. Lett. 64, No. 4 (1997), 161-164.
3. S. Even and Y. Shiloach, An on-line edge-delection problem, J. Assoc. Comput. Mach. 28, No. 1 (1981), 1-4.
4. D. Eppstein, Z. Galil, G. F. Italiano, and A. Nissenzweig, Sparsification - A technique for speeding up dynamic graph algorithms, J. Assoc. Comput. Mach. 44, No. 5 (1997) 669-696. [See also FOCS'92]
5. M. L. Fredman and M. R. Henzinger, Lower Sounds for fully dynamic connectivity problems in graphs, Algorithmica 22 No. 3 (1998), 351-362.
6. M. L. Fredman and M. E. Saks, The cell probe complexity of dynamic data structures, in "Proc. 21th ACM Symp. on Theory of Computing, 1989," pp. 345-354.
7. M. R. Henzinger and V. King, Randomized dynamic graph algorithms with polylogarithmic time per operation, in "Proc. 27th ACM Symp. on Theory of Computing, 1995," pp. 519-527.
8. M. R. Henzinger and V. King, "Fully dynamic 2-Edge Connectivity Algorithm in Polylogarithmic Time per Operation," Technical Report SRC 1997-004a, Digital, 1997. [A preliminary version appeared as [7]].
9. M. R. Henzinger, V. King, and T. Warnow, Constructing a tree from homeomorphic subtrees, with applications to computational evolutionary biology, in "Proc. 7th ACM-SIAM Symp. on Discrete Algorithms, 1996," pp. 333-340.
10. M. R. Henzinger and M. Thorup, Sampling to provide or to bound: With applications to fully dynamic graph algorithms, Random Struct. Algorithms 11 (1997), 369-379. [See also ICALP'96]
11. S. Kannan, T. Warnow, and S. Yooseph, Computing the local consensus of trees, in "Proc. 6th ACM-SIAM Symp. on Discrete Algorithm, 1995," pp. 68-77.
12. D. R. Karger, Random sampling in cut, flow, and network design problems, in "Proc. 26th ACM Symp. on Theory of Computing, 1994," pp. 56-63.
13. D. R. Karger, Minimum Cuts in Near-Linear Time, in "Proc. 28th ACM Symp. on Theory of Computing, 1996," pp. 56-63.
14. P. B. Miltersen, S. Subramanian, J. S. Vitter, and R. Tamassia, Complexity models for incremental computation, Theoret. Comput. Sci. 130 (1994), 203-236.
15. H. Nagamochi and T. Ibaraki, Linear time algorithms for finding k-edges connected and k-node connected spanning sub-graphs, Algorithmica 7 (1992), 583-596.
16. R. E. Tarjan, Efficiency of a good but not linear set union algorithm, J. Assoc. Comput. Mach. 22 (1975), 215-225.
17. M. Thorup, Decremental dynamic connectivity, in "Proc. 8th ACM-SIAM Symp. Discrete Algorithms, 1997," pp. 305-313, New Orleans.