@InProceedings{kritikakis_et_al:LIPIcs.SEA.2023.2,
author = {Kritikakis, Giorgos and Tollis, Ioannis G.},
title = {{Fast Reachability Using DAG Decomposition}},
booktitle = {21st International Symposium on Experimental Algorithms (SEA 2023)},
pages = {2:1--2:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-279-2},
ISSN = {1868-8969},
year = {2023},
volume = {265},
editor = {Georgiadis, Loukas},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SEA.2023.2},
URN = {urn:nbn:de:0030-drops-183526},
doi = {10.4230/LIPIcs.SEA.2023.2},
annote = {Keywords: graph algorithms, hierarchy, directed acyclic graphs (DAG), path/chain decomposition, transitive closure, transitive reduction, reachability, reachability indexing scheme}
}