12 citations · 16 across the 2 of their papers we have counts for
2 papers
cs.SI2014★ 4 cited
A Geometric Distance Oracle for Large Real-World Graphs
Deepak Ajwani, W. Sean Kennedy, Alessandra Sala +1
Many graph processing algorithms require determination of shortest-path distances between arbitrary numbers of node pairs. Since computation of exact distances between all node-pai…
cs.DS2006★ 12 cited
An O(n^{2.75}) algorithm for online topological ordering
Deepak Ajwani, Tobias Friedrich, Ulrich Meyer
We present a simple algorithm which maintains the topological order of a directed acyclic graph with n nodes under an online edge insertion sequence in O(n^{2.75}) time, independen…