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.
Author supplied keywords
Cite
CITATION STYLE
Zou, Y., Zeng, G., Wang, Y., Liu, X., Sun, X., Zhang, J., & Li, Q. (2016). Shortest paths on evolving graphs. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9795, pp. 1–13). Springer Verlag. https://doi.org/10.1007/978-3-319-42345-6_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
