Randomized fully dynamic graph algorithms with polylogarithmic time per operation
- 1 July 1999
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 46 (4) , 502-516
- https://doi.org/10.1145/320211.320215
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Sparsification—a technique for speeding up dynamic graph algorithmsJournal of the ACM, 1997
- Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning TreesSIAM Journal on Computing, 1997
- Separator Based Sparsification: I. Planarity Testing and Minimum Spanning TreesJournal of Computer and System Sciences, 1996
- Fully dynamic biconnectivity in graphsAlgorithmica, 1995
- Complexity models for incremental computationTheoretical Computer Science, 1994
- A linear-time algorithm for finding a sparsek-connected spanning subgraph of ak-connected graphAlgorithmica, 1992
- Maintenance of a minimum spanning forest in a dynamic plane graphJournal of Algorithms, 1992
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- A data structure for dynamic treesJournal of Computer and System Sciences, 1983
- An On-Line Edge-Deletion ProblemJournal of the ACM, 1981