Abstract
We develop the data structure PReaCH (for Pruned Reachability Contraction Hierarchies) which supports reachability queries in a directed graph. PReaCH adapts the contraction hierarchy speedup techniques for shortest path queries to the reachability setting. The resulting approach is surprisingly simple and guarantees linear space and near linear preprocessing time. Orthogonally to that, we improve existing pruning techniques for the search by gathering more information from a single DFS-traversal of the graph. In particular, we show that more classes of node numberings can be used to obtain strong pruning information. © 2014 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Merz, F., & Sanders, P. (2014). PReaCH: A fast lightweight reachability index using pruning and contraction hierarchies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8737 LNCS, pp. 701–712). Springer Verlag. https://doi.org/10.1007/978-3-662-44777-2_58
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
