Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks

Ye Wang, Qing Wang, Henning Koehler +1

Computing shortest paths is a fundamental operation in processing graph data. In many real-world applications, discovering shortest paths between two vertices empowers us to make f…