A topological approach to dynamic graph connectivity
- 20 April 1987
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 25 (1), 65-70
- https://doi.org/10.1016/0020-0190(87)90095-0
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Depth-first search is inherently sequentialInformation Processing Letters, 1985
- An On-Line Edge-Deletion ProblemJournal of the ACM, 1981
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976
- Efficiency of a Good But Not Linear Set Union AlgorithmJournal of the ACM, 1975
- The circuit value problem is log space complete for PACM SIGACT News, 1975
- An observation on time-storage trade offJournal of Computer and System Sciences, 1974
- Efficient Planarity TestingJournal of the ACM, 1974
- Dividing a Graph into Triconnected ComponentsSIAM Journal on Computing, 1973
- Algorithm 447: efficient algorithms for graph manipulationCommunications of the ACM, 1973
- Depth-First Search and Linear Graph AlgorithmsSIAM Journal on Computing, 1972