60 citations · 547 across the 40 of their papers we have counts for
1 paper · 1 filter
Stephan Seufert, Avishek Anand, Srikanta Bedathur +1
In this paper, we propose a scalable and highly efficient index structure for the reachability problem over graphs. We build on the well-known node interval labeling scheme where t…