Quasi-fully dynamic algorithms for two-connectivity, cycle equivalence and related problems

DOI10.1007/3-540-63397-9_25zbMATH Open1477.68234OpenAlexW1510718307MaRDI QIDQ826102

Vijaya Ramachandran, Madhukar R. Korupolu

Publication date: 20 December 2021

Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.80.3084

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Connectivity (05C40) Randomized algorithms (68W20)

Related Items (1)

Fully Dynamic Algorithms for 2-Edge Connectivity

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