I/O Efficient: Computing SCCs in Massive Graphs
Summary: I/O-efficient semi-external SCCs for graphs beyond memory. Uses a weak order to avoid DFS bias; offers two-phase SCC: tree construction, tree search; a single-phase variant with early acceptance/rejection and batch processing, reducing I/Os and CPU; validated on real data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Zhiwei Zhang (Chinese University of Hong Kong)
- 2. Jeffrey Xu Yu (Chinese University of Hong Kong)
- 3. Lu Qin (Chinese University of Hong Kong)
- 4. Lijun Chang (University of New South Wales)
- 5. Xuemin Lin (University of New South Wales)
BibTeX Citation
@inproceedings{zhang_sigmod13,
title = {{I/O Efficient: Computing SCCs in Massive Graphs}},
author = {Zhang, Zhiwei and Yu, Jeffrey Xu and Qin, Lu and Chang, Lijun and Lin, Xuemin},
series = {{SIGMOD} '13},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2463676.2463703},
url = {https://dl.acm.org/doi/10.1145/2463676.2463703},
year = {2013}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,535 | I/O Efficient ECC Graph Decomposition via Graph Reduction | 2016 | VLDB | 5.8486743e-05 |
| 9,625 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB | 5.2434488e-05 |
| 9,759 | Divide & Conquer: I/O Efficient Depth-First Search | 2015 | SIGMOD | 5.2247222e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 3 of 3 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 679 | GRAIL: Scalable Reachability Index for Large Graphs | 2010 | VLDB | 0.00015055389 |
| 2,718 | Graph Homomorphism Revisited for Graph Matching | 2010 | VLDB | 8.209788e-05 |
| 4,360 | Efficient External-Memory Bisimulation on DAGs | 2012 | SIGMOD | 6.7443622e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 11,198 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 2 | 9,625 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB |
| 3 | 594 | Massive Graph Triangulation | 2013 | SIGMOD |
| 4 | 3,737 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 5 | 8,623 | A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition | 2022 | VLDB |
| 6 | 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 7 | 3,261 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD |
| 8 | 6,535 | I/O Efficient ECC Graph Decomposition via Graph Reduction | 2016 | VLDB |
| 9 | 7,578 | Minimum Strongly Connected Subgraph Collection in Dynamic Graphs | 2024 | VLDB |
| 10 | 9,759 | Divide & Conquer: I/O Efficient Depth-First Search | 2015 | SIGMOD |