Decremental Dynamic Connectivity
- 1 November 1999
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 33 (2) , 229-243
- https://doi.org/10.1006/jagm.1999.1033
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Lower Bounds for Fully Dynamic Connectivity Problems in GraphsAlgorithmica, 1998
- Sampling to provide or to bound: With applications to fully dynamic graph algorithmsRandom Structures & Algorithms, 1997
- Optimal on-line decremental connectivity in treesInformation Processing Letters, 1997
- Sparsification—a technique for speeding up dynamic graph algorithmsJournal of the ACM, 1997
- Minimum cuts in near-linear timePublished by Association for Computing Machinery (ACM) ,1996
- Randomized dynamic graph algorithms with polylogarithmic time per operationPublished by Association for Computing Machinery (ACM) ,1995
- Random sampling in cut, flow, and network design problemsPublished by Association for Computing Machinery (ACM) ,1994
- The cell probe complexity of dynamic data structuresPublished by Association for Computing Machinery (ACM) ,1989
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational ExpressionsSIAM Journal on Computing, 1981
- An On-Line Edge-Deletion ProblemJournal of the ACM, 1981