Improved Data Structures for Fully Dynamic Biconnectivity

DOI10.1137/S0097539794263907zbMath0953.68042MaRDI QIDQ4507325

Monika R. Henzinger

Publication date: 18 October 2000

Published in: SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

data structuresbiconnectivitydynamic graph algorithms

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05)

Related Items (2)

A survey on combinatorial optimization in dynamic environments ⋮ Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier

This page was built for publication: Improved Data Structures for Fully Dynamic Biconnectivity