Faster fully dynamic transitive closure in practice

DOI10.4230/LIPICS.SEA.2020.14MaRDI QIDQ6487607zbMATH OpenFDO

Authors Kathrin Hanauer, Monika R. Henzinger, Christian Schulz

Publication date 7 February 2023

Full work available at URL https://doi.org/10.4230/LIPICS.SEA.2020.14

zbMATH Keywords

dynamic graph algorithmsreachabilitytransitive closure

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• scientific article; zbMATH DE number 2079364
• A faster and simpler fully dynamic transitive closure
• Algorithms – ESA 2005
• An experimental study of algorithms for fully dynamic transitive closure
• Improved Dynamic Reachability Algorithms for Directed Graphs

Cited in

(10)

• Efficient computation of transitive closures
• Reachability preserving compression for dynamic graph
• Cache-Friendly implementations of transitive closure
• scientific article; zbMATH DE number 2079364 (Why is no real title available?)
• A faster and simpler fully dynamic transitive closure
• An experimental study of algorithms for fully dynamic transitive closure
• An experimental study of dynamic algorithms for transitive closure
• Algorithms – ESA 2005
• Dynamic Matching Algorithms in Practice
• O’Reach: Even Faster Reachability in Large Graphs

This page was built for publication: Faster fully dynamic transitive closure in practice

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