Lower bounds for dynamic connectivity

DOI10.1145/1007352.1007435zbMath1192.68185OpenAlexW2153217785MaRDI QIDQ3580993

Erik D. Demaine, Mihai Pǎtraşcu

Publication date: 15 August 2010

Published in: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (2)

Faster Fully-Dynamic Minimum Spanning Forest ⋮ On the quantifier-free dynamic complexity of reachability

This page was built for publication: Lower bounds for dynamic connectivity