A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is application/pdf
.
O'Reach: Even Faster Reachability in Large Graphs
2022
ACM Journal of Experimental Algorithmics
One of the most fundamental problems in computer science is the reachability problem : Given a directed graph and two vertices s and t , can s reach t via a path? We revisit existing techniques and combine them with new approaches to support a large portion of reachability queries in constant time using a linear-sized reachability index . Our new algorithm O'Reach can be easily combined with previously developed solutions for the problem or run standalone . In a detailed experimental study, we
doi:10.1145/3556540
fatcat:osnkjz77lzhqxcd67p3puafwzu