Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees
Summary: Maintains Contraction Hierarchies under streaming and batch road-network updates via a shortcut-centric SS-Graph and weight propagation, avoiding broad index reconstruction. Provides theoretical guarantees and 2–3 orders-of-magnitude faster streaming maintenance than prior work. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Dian Ouyang (Nanjing University; University of Sydney)
- 2. Long Yuan (Nanjing University)
- 3. Lu Qin (University of Technology Sydney)
- 4. Lijun Chang (University of Sydney)
- 5. Ying Zhang (University of Technology Sydney)
- 6. Xuemin Lin (University of New South Wales)
BibTeX Citation
@article{ouyang_vldb20,
title = {{Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees}},
author = {Ouyang, Dian and Yuan, Long and Qin, Lu and Chang, Lijun and Zhang, Ying and Lin, Xuemin},
journal = {PVLDB},
series = {{VLDB} '20},
volume = {13},
number = {5},
pages = {602--615},
doi = {10.14778/3377369.3377371},
url = {https://doi.org/10.14778/3377369.3377371},
year = {2020}
}
Incoming Citations (Sorted by Pagerank)
Showing 19 of 19 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next