Improved data structures for fully dynamic biconnectivity
From MaRDI portal
Publication:2817663
DOI10.1145/195058.195434zbMath1344.68062OpenAlexW2069731308MaRDI QIDQ2817663
Publication date: 1 September 2016
Published in: Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 (Search for Journal in Brave)
Full work available at URL: https://hdl.handle.net/1813/6194
Planar graphs; geometric and topological aspects of graph theory (05C10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Data structures (68P05) Connectivity (05C40)
Related Items (10)
Dynamic connectivity in digital images ⋮ Lower bounds for dynamic algorithms ⋮ Dyn-FO: A parallel, dynamic complexity class ⋮ Decremental 2- and 3-connectivity on planar graphs ⋮ Faster possibility detection by combining two approaches ⋮ Certificates and fast algorithms for biconnectivity in fully-dynamic graphs ⋮ Fully Dynamic Transitive Closure in plane dags with one source and one sink ⋮ A dynamic algorithm for line graph recognition ⋮ Output-sensitive reporting of disjoint paths (extended abstract) ⋮ An approximation algorithm for minimum-cost vertex-connectivity problems
This page was built for publication: Improved data structures for fully dynamic biconnectivity
