19 citations · 24 across the 7 of their papers we have counts for
1 paper · 1 filter
Ruoming Jin, Guan Wang
A reachability oracle (or hop labeling) assigns each vertex v two sets of vertices: Lout(v) and Lin(v), such that u reaches v iff Lout(u) \cap Lin(v) \neq \emptyset. Despite their…