An Experimental Study of Dynamic Algorithms for Transitive Closure
From MaRDI portal
Publication:5269373
DOI10.1145/945394.945403zbMath1365.68510MaRDI 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
68W40: Analysis of algorithms
68R10: Graph theory (including graph drawing) in computer science
05C85: Graph algorithms (graph-theoretic aspects)
68W20: Randomized algorithms
Related Items
Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time, An efficient strongly connected components algorithm in the fault tolerant model, Dynamic shortest paths and transitive closure: algorithmic techniques and data structures, A Fully Dynamic Reachability Algorithm for Directed Graphs with an Almost Linear Update Time, An Optimal Constraint Programming Approach to the Open-Shop Problem