An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms

DOI10.1145/945394.945398zbMath1085.68743OpenAlexW2026187504MaRDI QIDQ5463421

Mikkel Thorup, Raj D. Jun. Iyer, Hariharan S. Rahul, David R. Karger

Publication date: 4 August 2005

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: http://www.jea.acm.org/2001/IyerConnectivity/

Mathematics Subject Classification ID

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

Related Items (3)

Maintaining dynamic minimum spanning trees: an experimental study ⋮ Fast compatibility testing for rooted phylogenetic trees ⋮ Tree compatibility, incomplete directed perfect phylogeny, and dynamic graph connectivity: an experimental study

This page was built for publication: An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms