O’Reach: Even Faster Reachability in Large Graphs

DOI10.1145/3556540OpenAlexW3128674493MaRDI QIDQ6127828FDOQ6127828

Author name not available (Why is that?), 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)

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)