Maintaining bridge-connected and biconnected components on-line
- 1 June 1992
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 7 (1-6) , 433-464
- https://doi.org/10.1007/bf01758773
Abstract
No abstract availableKeywords
This publication has 21 references indexed in Scilit:
- Incremental planarity testingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- New Connectivity and MSF Algorithms for Shuffle-Exchange Network and PRAMIEEE Transactions on Computers, 1987
- On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union ProblemSIAM Journal on Computing, 1986
- Data Structures for On-Line Updating of Minimum Spanning Trees, with ApplicationsSIAM Journal on Computing, 1985
- Self-adjusting binary search treesJournal of the ACM, 1985
- Worst-case Analysis of Set Union AlgorithmsJournal of the ACM, 1984
- Data Structures and Network AlgorithmsPublished by Society for Industrial & Applied Mathematics (SIAM) ,1983
- Should Tables Be Sorted?Journal of the ACM, 1981
- An On-Line Edge-Deletion ProblemJournal of the ACM, 1981
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975