23 citations · 29 across the 6 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DB2021★ 23 cited
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…
cs.DS2021★ 2 cited
Efficient Maintenance of Distance Labelling for Incremental Updates in Large Dynamic Graphs
Muhammad Farhan, Qing Wang
Finding the shortest path distance between an arbitrary pair of vertices is a fundamental problem in graph theory. A tremendous amount of research has been successfully attempted o…