Database Paper Browser

Back to papers

Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees

Summary: Proposes Practical Pregel Algorithms (PPAs) with linear space, per-iteration cost bounds, and logarithmic iterations for distributed graph connectivity. PPAs for CCs, BCCs, SCCs built from building-block PPAs; experiments on large real graphs confirm efficiency. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
10880
Venue
VLDB
Year
2014
Pagerank
7.8823626e-05
Overall Rank
2,927 | 79.64%
DOI
-

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

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