A simple and practical $o(\sqrt{n})$-time algorithm for shortest paths in power law graphs

Jiaqi Mao

Computing shortest paths in large graphs is, and remains, a fundamental and practically motivated problem. While many algorithms were proposed to calculate shortest path between pa…