Optimal on-line decremental connectivity in trees

Information Processing Letters

Volumn 64, Issue 4, 1997, Pages 161-164

  Alstrup, Stephen ^a   Secher, Jens Peter ^a   Spork, Maz ^a  

^a UNIVERSITY OF COPENHAGEN   (Denmark)

Author keywords

Algorithms; Trees and connectivity

Indexed keywords

EID: 0346715112     PISSN: 00200190     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0020-0190(97)00170-1     Document Type: Article

References (7)

1. S. Even, Y. Shiloach, An on-line edge-deletion problem, J. ACM 28 (1981) 1-4.
2. G.N. Frederickson, Data structures for on-line updating of minimum spanning trees, with applications, SIAM J. Comput. 14 (4) (1985) 781-798.
3. G.N. Frederickson, Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning tree, SIAM J. Comput. 26 (2) (1997) 484-538.
4. H.N. Gabow, Data structure for weighted matching and nearest common ancestors with linking, in: Proc. Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA), vol. 1, 1990, pp. 434-443.
5. H.N. Gabow, R.E. Tarjan, A linear-time algorithm for a special case of disjoint set union, J. Comput. System Sci. 30 (2) (1985) 209-221.
6. M.R. Henzinger, V. King, Randomized dynamic graph algorithms with polylogarithmic time per operation, in: Proc. 28th ACM Symp. on the Theory of Computing (STOC), 1995, pp. 519-527.
7. M. Thorup, Decremental dynamic connectivity, in: Proc. 8th ACM-SIAM Symp. on Discrete Algorithms (SODA), 1997, pp. 305-313.