O’Reach: Even Faster Reachability in Large Graphs

DOI10.1145/3556540OpenAlexW3128674493MaRDI QIDQ6127828FDOQ6127828

Authors Kathrin Hanauer, Christian Schulz

Publication date 14 April 2024

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

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

zbMATH Keywords

graph algorithmsreachabilityalgorithm engineeringreachability indexstatic graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• O'Reach: Even Faster Reachability in Large Graphs
• PReaCH: a fast lightweight reachability index using pruning and contraction hierarchies
• Faster fully dynamic transitive closure in practice
• Improved Dynamic Reachability Algorithms for Directed Graphs
• A fully dynamic reachability algorithm for directed graphs with an almost linear update time

Cited in

(1)

• Reachability in big graphs: a distributed indexing and querying approach

This page was built for publication: O’Reach: Even Faster Reachability in Large Graphs

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