Quasi-fully dynamic algorithms for two-connectivity and cycle equivalence

DOI10.1007/S00453-001-0108-5zbMath0994.68093OpenAlexW1987108166MaRDI QIDQ1601008

Madhukar R. Korupolu, Vijaya Ramachandran

Publication date: 17 June 2002

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-001-0108-5

zbMATH Keywords

dynamic graph algorithms

Mathematics Subject Classification ID

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

This page was built for publication: Quasi-fully dynamic algorithms for two-connectivity and cycle equivalence