Database Paper Browser

Back to papers

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

Summary: Proposes a hybrid search paradigm and divide-and-conquer distributed algorithm for HC-s-t path enumeration on billion-scale graphs, with pruning and bounded memory to enable high parallelism. Adds idle-machine load balancing and bidirectional search to boost efficiency; experiments demonstrate scalable performance. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
12672
Venue
VLDB
Year
2022
Pagerank
4.6817479e-05
Overall Rank
7,675 | 46.61%
DOI
10.14778/3489496.3489499

Incoming Non-self Citations Over Time

Authors

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