Hierarchical Cut Labelling - Scaling Up Distance Queries on Road Networks
Abstract
References
Index Terms
- Hierarchical Cut Labelling - Scaling Up Distance Queries on Road Networks
Recommendations
BatchHL: Answering Distance Queries on Batch-Dynamic Networks at Scale
SIGMOD '22: Proceedings of the 2022 International Conference on Management of DataMany real-world applications operate on dynamic graphs that undergo rapid changes in their topological structure over time. However, it is challenging to design dynamic algorithms that are capable of supporting such graph changes efficiently. To ...
Fast fully dynamic labelling for distance queries
AbstractFinding the shortest-path distance between an arbitrary pair of vertices is a fundamental problem in graph theory. A tremendous amount of research has explored this problem, most of which is limited to static graphs. Due to the dynamic nature of ...
When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks
AbstractComputing the shortest distance between two vertices is a fundamental problem in road networks. Since a direct search using the Dijkstra’s algorithm results in a large search space, researchers resort to indexing-based approaches. State-of-the-art ...
Comments
Information & Contributors
Information
Published In
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 353Total Downloads
- Downloads (Last 12 months)353
- Downloads (Last 6 weeks)40
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in