DBScholar

Back to papers

Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement

Summary: Compares traversal-based and extension-based shortest-path methods on graphs, detailing space-time trade-offs and cost of augmented indexes. Proposes Monotonic Landmark Labeling (MLL) to bound index space and guarantee query-time, guiding method choice. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12940
Venue
VLDB
Year
2022
Pagerank
6.1246854e-05
Overall Rank
5,678 | 61.05%
DOI
10.14778/3551793.3551820

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{zhang_vldb22,
        title = {{Shortest-Path Queries on Complex Networks: Experiments, Analyses, and Improvement}},
        author = {Zhang, Junhua and Li, Wentao and Yuan, Long and Qin, Lu and Zhang, Ying and Chang, Lijun},
        journal = {PVLDB},
        series = {{VLDB} '22},
        volume = {15},
        number = {11},
        pages = {2640--2652},
        doi = {10.14778/3551793.3551820},
        url = {https://doi.org/10.14778/3551793.3551820},
        year = {2022}
}

Incoming Citations (Sorted by Pagerank)

Showing 5 of 5 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 14 of 14 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Previous Page 1 / 1 Next

Semantically Similar Papers