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
- 2. Jeffrey Xu Yu
- 3. Lu Qin
- 4. Lijun Chang
- 5. Xuemin Lin
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,346 | I/O Efficient ECC Graph Decomposition via Graph Reduction | 2016 | VLDB | 4.7556749e-05 |
| 9,483 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB | 4.3341665e-05 |
| 9,626 | Divide & Conquer: I/O Efficient Depth-First Search | 2015 | SIGMOD | 4.314762e-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 |
|---|---|---|---|---|
| 733 | GRAIL: Scalable Reachability Index for Large Graphs | 2010 | VLDB | 0.00017460741 |
| 2,938 | Graph Homomorphism Revisited for Graph Matching | 2010 | VLDB | 7.8524059e-05 |
| 3,677 | Efficient External-Memory Bisimulation on DAGs | 2012 | SIGMOD | 6.8533416e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,985 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 4.1945683e-05 |
| 9,483 | I/O Efficient Label-Constrained Reachability Queries in Large Graphs | 2024 | VLDB | 4.3341665e-05 |
| 589 | Massive Graph Triangulation | 2013 | SIGMOD | 0.00019576567 |
| 4,344 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD | 6.2744553e-05 |
| 8,630 | A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition | 2022 | VLDB | 4.480887e-05 |
| 6,207 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 5.1572428e-05 |
| 3,854 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD | 6.6988744e-05 |
| 7,346 | I/O Efficient ECC Graph Decomposition via Graph Reduction | 2016 | VLDB | 4.7556749e-05 |
| 7,716 | Minimum Strongly Connected Subgraph Collection in Dynamic Graphs | 2024 | VLDB | 4.6696364e-05 |
| 9,626 | Divide & Conquer: I/O Efficient Depth-First Search | 2015 | SIGMOD | 4.314762e-05 |