Optimal Reachability and a Space-Time Tradeoff for Distance Queries in Constant-Treewidth Graphs


We consider data-structures for answering reachability and distance queries on constant-treewidth graphs with n nodes, on the standard RAM computational model with wordsize W = Θ(logn). Our first contribution is a data-structure that after O(n) preprocessing time, allows (1) pair reachability queries in O(1) time; and (2) single-source reachability queries… (More)
DOI: 10.4230/LIPIcs.ESA.2016.28


3 Figures and Tables