A Sublinear Algorithm for Approximate Shortest Paths in Large Networks

Sabyasachi Basu, Nadia Kōshima, Talya Eden +2

Computing distances and finding shortest paths in massive real-world networks is a fundamental algorithmic task in network analysis. There are two main approaches to solving this t…