Kathrin Hanauer, Christian Schulz 0003, Jonathan Trummer. O'Reach: Even Faster Reachability in Large Graphs. ACM Journal of Experimental Algorithmics, 27, 2022. [doi]
@article{HanauerST22,
title = {O'Reach: Even Faster Reachability in Large Graphs},
author = {Kathrin Hanauer and Christian Schulz 0003 and Jonathan Trummer},
year = {2022},
doi = {10.1145/3556540},
url = {https://doi.org/10.1145/3556540},
researchr = {https://researchr.org/publication/HanauerST22},
cites = {0},
citedby = {0},
journal = {ACM Journal of Experimental Algorithmics},
volume = {27},
}