Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks
Summary: Divide-and-conquer framework with recursive vertex bipartitioning and a count reconstruction theorem to compose shortest-path counts from subgraphs. Integrates a 2-hop count labeling; experiments show ~2× query speed, ~4× label construction, and ~20% labeling space.
(summarized by gpt-5-nano on Feb 09 2026)
@inproceedings{farhan_sigmod25,
title = {{Divide-and-Conquer: Scalable Shortest Path Counting on Large Road Networks}},
author = {Farhan, Muhammad and Koehler, Henning and Wang, Qing},
series = {{SIGMOD} '25},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3725400},
url = {https://dl.acm.org/doi/10.1145/3725400},
year = {2025}
}
Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
Rank
Citing Paper
Year
Venue
Pagerank
PreviousPage 1 / 1Next
Outgoing Citations (Sorted by Pagerank)
Showing 13 of 13 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.