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

DOI10.1007/S00453-001-0108-5MaRDI QIDQ1601008zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Quasi-fully dynamic algorithms for two-connectivity, cycle equivalence and related problems
• scientific article; zbMATH DE number 1256640
• scientific article; zbMATH DE number 1003251
• Fully Dynamic Algorithms for 2-Edge Connectivity
• scientific article; zbMATH DE number 1263228

Cited in

(2)

• Fully Dynamic Algorithms for 2-Edge Connectivity
• Quasi-fully dynamic algorithms for two-connectivity, cycle equivalence and related problems

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1601008)