O'Reach: Even Faster Reachability in Large Graphs

From MaRDI portal

Publication:6159900

Jump to:navigation, search

DOI10.4230/LIPICS.SEA.2021.13arXiv2008.10932OpenAlexW3165168009MaRDI QIDQ6159900

Christian Schulz, Unnamed Author, Kathrin Hanauer

Publication date: 23 June 2023

Full work available at URL: https://arxiv.org/abs/2008.10932

zbMATH Keywords

reachability graph algorithms algorithm engineering reachability index static graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

This page was built for publication: O'Reach: Even Faster Reachability in Large Graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:6159900&oldid=35632772"