Divide & Conquer: I/O Efficient Depth-First Search
Summary: IO-efficient semi-external DFS on disk graphs via divide-and-conquer: split G into subgraphs, compute local DFS trees in memory, then merge to a global DFS-Tree. Proposes Divide-Star and Divide-TD schemes with a merge, validates correctness, and demonstrates I/O gains on real and synthetic data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Zhiwei Zhang (Chinese University of Hong Kong)
- 2. Jeffrey Xu Yu (Chinese University of Hong Kong)
- 3. Lu Qin (University of Technology Sydney)
- 4. Zechao Shang (Chinese University of Hong Kong)
BibTeX Citation
@inproceedings{zhang_sigmod15,
title = {{Divide \& Conquer: I/O Efficient Depth-First Search}},
author = {Zhang, Zhiwei and Yu, Jeffrey Xu and Qin, Lu and Shang, Zechao},
series = {{SIGMOD} '15},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/2723372.2723740},
url = {https://dl.acm.org/doi/10.1145/2723372.2723740},
year = {2015}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 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 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 1 of 1 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 12,239 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,083 | Fast Hierarchy Construction for Dense Subgraphs | 2017 | VLDB |
| 2 | 2,453 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD |
| 3 | 11,198 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 4 | 3,857 | Efficient Processing of Distance Queries in Large Graphs: A Vertex Cover Approach | 2012 | SIGMOD |
| 5 | 3,737 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 6 | 11,256 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB |
| 7 | 8,623 | A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition | 2022 | VLDB |
| 8 | 6,535 | I/O Efficient ECC Graph Decomposition via Graph Reduction | 2016 | VLDB |
| 9 | 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 10 | 12,239 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD |