An Experimental Study of Dynamic Algorithms for Transitive Closure

DOI10.1145/945394.945403zbMath1365.68510OpenAlexW2014881855MaRDI QIDQ5269373

Tobias Miller, Christos D. Zaroliagis, Daniele Frigioni, Umberto Nanni

Publication date: 15 June 2017

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

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

zbMATH Keywords

transitive closureexperimentationdynamic algorithm

Mathematics Subject Classification ID

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

Related Items (5)

Dynamic shortest paths and transitive closure: algorithmic techniques and data structures ⋮ An efficient strongly connected components algorithm in the fault tolerant model ⋮ A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time ⋮ An Optimal Constraint Programming Approach to the Open-Shop Problem ⋮ Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time

This page was built for publication: An Experimental Study of Dynamic Algorithms for Transitive Closure