Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

DOI10.1145/502090.502095zbMATH Open1127.68408DBLPjournals/jacm/HolmLT01OpenAlexW2045430818WikidataQ55951524 ScholiaQ55951524MaRDI QIDQ5441357

Author name not available (Why is that?)

Publication date: 11 February 2008

Published in: (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/502090.502095

Mathematics Subject Classification ID

No records found.

This page was built for publication: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity

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