DBScholar

Back to papers

Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale

Summary: A distributed hybrid-search, divide-and-conquer algorithm enumerates hop-constrained simple s-t paths at billion-graph scale, pruning fruitless exploration while bounding memory. Idle-triggered load balancing handles skew, and bidirectional search further accelerates enumeration. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
12860
Venue
VLDB
Year
2022
Pagerank
5.6236086e-05
Overall Rank
7,418 | 49.11%
DOI
10.14778/3489496.3489499

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{hao_vldb22,
        title = {{Distributed Hop-Constrained s-t Simple Path Enumeration at Billion Scale}},
        author = {Hao, Kongzhang and Yuan, Long and Zhang, Wenjie},
        journal = {PVLDB},
        series = {{VLDB} '22},
        volume = {15},
        number = {2},
        pages = {169--182},
        doi = {10.14778/3489496.3489499},
        url = {https://doi.org/10.14778/3489496.3489499},
        year = {2022}
}

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 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