O'Reach: Even Faster Reachability in Large Graphs

Kathrin Hanauer, Christian Schulz 0003, Jonathan Trummer. O'Reach: Even Faster Reachability in Large Graphs. ACM Journal of Experimental Algorithmics, 27, 2022. [doi]

Authors

Kathrin Hanauer

This author has not been identified. Look up 'Kathrin Hanauer' in Google

Christian Schulz 0003

This author has not been identified. Look up 'Christian Schulz 0003' in Google

Jonathan Trummer

This author has not been identified. Look up 'Jonathan Trummer' in Google