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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.