Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks
Query-by-Sketch: Scaling Shortest Path Graph Queries on Very Large Networks
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 full use of the underlying structure to understand how vertices are related in a graph, e.g. the strength of social ties between individuals in a …