Shortest Paths on Evolving Graphs

Yiming Zou, Gang Zeng, Yuyi Wang, Xingwu Liu, Xiaoming Sun, Jialin Zhang, Qiang Li

Abstract: We consider the shortest path problem in evolving graphs with restricted access, i.e., the changes are unknown and can be probed only by limited queries. The goal is to maintain a shortest path between a given pair of nodes. We propose a heuristic algorithm that takes into account time-dependent edge reliability and reduces the problem to find an edge-weighted shortest path. Our algorithm leads to higher precision and recall than those of the existing method introduced in [5] on both real-life data and synthetic data, while the error is negligible.