Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees
Summary: Defines practical Pregel algorithms (PPAs) with linear per-iteration space, communication, and work, plus logarithmic rounds. Delivers scalable CC, BCC, and SCC algorithms with reusable primitives, validated on massive real-world graphs. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Da Yan (Chinese University of Hong Kong)
- 2. James Cheng (Chinese University of Hong Kong)
- 3. Kai Xing (Hong Kong University of Science and Technology)
- 4. Yi Lu (Chinese University of Hong Kong)
- 5. Wilfred Ng (Hong Kong University of Science and Technology)
- 6. Yingyi Bu (University of California Irvine)
BibTeX Citation
@article{yan_vldb14,
title = {{Pregel Algorithms for Graph Connectivity Problems with Performance Guarantees}},
author = {Yan, Da and Cheng, James and Xing, Kai and Lu, Yi and Ng, Wilfred and Bu, Yingyi},
journal = {PVLDB},
series = {{VLDB} '14},
volume = {7},
number = {14},
pages = {1821--1832},
doi = {10.14778/2733085.2733089},
url = {https://doi.org/10.14778/2733085.2733089},
year = {2014}
}Incoming Citations (Sorted by Pagerank)
Showing 13 of 13 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.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD | 0.0012250108 |
| 20 | Distributed GraphLab: A Framework for Machine Learning and Data Mining in the Cloud | 2012 | VLDB | 0.00056944564 |
| 674 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD | 0.00015081844 |
| 937 | Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs | 2014 | VLDB | 0.00013091546 |
| 1,533 | TF-Label: a Topological-Folding Labeling Scheme for Reachability Querying in a Large Graph | 2013 | SIGMOD | 0.00010467148 |
| 2,295 | Optimizing Graph Algorithms on Pregel-like Systems | 2014 | VLDB | 8.7932254e-05 |
| 2,539 | Minimal MapReduce Algorithms | 2013 | SIGMOD | 8.4526595e-05 |
| 3,857 | Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach | 2012 | SIGMOD | 7.0678455e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 487 | From "Think Like a Vertex" to "Think Like a Graph" | 2014 | VLDB |
| 2 | 1,300 | An Experimental Comparison of Pregel-like Graph Processing Systems | 2014 | VLDB |
| 3 | 3,511 | Scalable Discovery of Best Clusters on Large Graphs | 2010 | VLDB |
| 4 | 937 | Blogel: A Block-Centric Framework for Distributed Computation on Real-World Graphs | 2014 | VLDB |
| 5 | 11,394 | Parallel Strong Connectivity Based on Faster Reachability | 2023 | SIGMOD |
| 6 | 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 7 | 3,008 | Scalable Big Graph Processing in MapReduce | 2014 | SIGMOD |
| 8 | 1,875 | Large-Scale Distributed Graph Computing Systems: An Experimental Evaluation | 2015 | VLDB |
| 9 | 3 | Pregel: A System for Large-Scale Graph Processing | 2010 | SIGMOD |
| 10 | 2,295 | Optimizing Graph Algorithms on Pregel-like Systems | 2014 | VLDB |