Decremental Dynamic Connectivity

DOI10.1006/jagm.1999.1033zbMath0957.68091OpenAlexW2095571038MaRDI QIDQ4935307

Mikkel Thorup

Publication date: 19 March 2000

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1999.1033

zbMATH Keywords

\(k\)-edge-connectivity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Incomplete directed perfect phylogeny in linear time ⋮ Optimal decremental connectivity in planar graphs ⋮ Randomization for Efficient Dynamic Graph Algorithms ⋮ Dynamic connectivity for axis-parallel rectangles ⋮ Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study ⋮ Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time

This page was built for publication: Decremental Dynamic Connectivity