Optimal on-line decremental connectivity in trees
- 1 November 1997
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 64 (4) , 161-164
- https://doi.org/10.1016/s0020-0190(97)00170-1
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning TreesSIAM Journal on Computing, 1997
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- A linear-time algorithm for a special case of disjoint set unionJournal of Computer and System Sciences, 1985
- An On-Line Edge-Deletion ProblemJournal of the ACM, 1981