I/O Efficient ECC Graph Decomposition via Graph Reduction

Summary: I/O efficient ECC decomposition for all k values achieved via two graph-reduction operators that shrink the in-memory graph while preserving k-edge connectivity. Bottom-Up, Top-Down, and Hybrid algorithms explore k-values in different orders to minimize redundant work, with experiments on graphs up to 1.95B edges demonstrating scalability. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 11342
Venue: VLDB
Year: 2016
Pagerank: 4.7556749e-05
Overall Rank: 7,346 | 48.90%
DOI: -

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 9 of 9 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
2,547	Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees	2020	VLDB	8.5683079e-05
3,321	Hierarchical Core Maintenance on Large Dynamic Graphs	2021	VLDB	7.223972e-05
4,743	Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions	2021	SIGMOD	5.9586508e-05
8,630	A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition	2022	VLDB	4.480887e-05
9,390	Efficient Maximum s-Bundle Search via Local Vertex Connectivity	2025	SIGMOD	4.3441378e-05
9,483	I/O Efficient Label-Constrained Reachability Queries in Large Graphs	2024	VLDB	4.3341665e-05
10,535	In-depth Analysis of Densest Subgraph Discovery in a Unified Framework	2025	VLDB	4.1945683e-05
10,582	A Flexible Framework for Query-oriented Interactive Community Search	2025	VLDB	4.1945683e-05
10,681	Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory	2025	VLDB	4.1945683e-05

Outgoing Citations (Sorted by Pagerank)

Showing 10 of 10 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
108	Truss Decomposition in Massive Networks	2012	VLDB	0.00048300163
110	On Triangulation-based Dense Neighborhood Graph Discovery	2011	VLDB	0.00047892924
589	Massive Graph Triangulation	2013	SIGMOD	0.00019576567
686	Finding Maximal Cliques in Massive Networks by H*-graph	2010	SIGMOD	0.00018178029
738	Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis	2013	VLDB	0.00017435236
3,020	GConnect: A Connectivity Index for Massive Disk-Resident Graphs	2009	VLDB	7.6992238e-05
3,854	Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity	2015	SIGMOD	6.6988744e-05
6,207	Efficiently Computing k-Edge Connected Components via Graph Decomposition	2013	SIGMOD	5.1572428e-05
9,626	Divide & Conquer: I/O Efficient Depth-First Search	2015	SIGMOD	4.314762e-05
12,041	I/O Efficient: Computing SCCs in Massive Graphs	2013	SIGMOD	4.1945683e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
9,146	Accelerating Core Decomposition in Billion-Scale Hypergraphs	2025	SIGMOD	4.3849295e-05
10,159	Efficient Influential Community Search over Dynamic Graphs	2026	SIGMOD	4.1945683e-05
3,854	Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity	2015	SIGMOD	6.6988744e-05
11,048	Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs	2024	VLDB	4.1945683e-05
9,626	Divide & Conquer: I/O Efficient Depth-First Search	2015	SIGMOD	4.314762e-05
4,984	Efficient Maximum k-Defective Clique Computation with Improved Time Complexity	2023	SIGMOD	5.7867286e-05
966	Streaming Algorithms for k-core Decomposition	2013	VLDB	0.00014960672
12,041	I/O Efficient: Computing SCCs in Massive Graphs	2013	SIGMOD	4.1945683e-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