A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition
Summary: Constructs the all-k edge-connected-component hierarchy via divide-and-conquer, reducing prior degeneracy-factor overhead to O(log δ(G)·TKECC). Space optimizations achieve 2m+O(n log δ) (and 2m+O(n) for fixed k), with up to 28× speedups. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Lijun Chang (University of Sydney)
- 2. Zhiyi Wang (University of Sydney)
BibTeX Citation
@article{chang_vldb22,
title = {{A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition}},
author = {Chang, Lijun and Wang, Zhiyi},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {6},
pages = {1146--1158},
doi = {10.14778/3514061.3514063},
url = {https://doi.org/10.14778/3514061.3514063},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,049 | BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs | 2025 | SIGMOD | 5.3251649e-05 |
| 11,256 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 1,307 | KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs | 2020 | VLDB | 0.00011232263 |
| 2,083 | Fast Hierarchy Construction for Dense Subgraphs | 2017 | VLDB | 9.1976617e-05 |
| 3,119 | GConnect: A Connectivity Index for Massive Disk-Resident Graphs | 2009 | VLDB | 7.7370163e-05 |
| 3,261 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD | 7.5853837e-05 |
| 3,395 | Efficient Size-Bounded Community Search over Large Networks | 2021 | VLDB | 7.44939e-05 |
| 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 6.1809407e-05 |
| 6,535 | I/O Efficient ECC Graph Decomposition via Graph Reduction | 2016 | VLDB | 5.8486743e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,759 | Divide & Conquer: I/O Efficient Depth-First Search | 2015 | SIGMOD |
| 2 | 3,993 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD |
| 3 | 10,273 | Nucleus Decomposition Revisited: An Efficient Counting-Based Approach | 2026 | SIGMOD |
| 4 | 1,640 | Distance-generalized Core Decomposition | 2019 | SIGMOD |
| 5 | 12,239 | I/O Efficient: Computing SCCs in Massive Graphs | 2013 | SIGMOD |
| 6 | 3,261 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD |
| 7 | 2,083 | Fast Hierarchy Construction for Dense Subgraphs | 2017 | VLDB |
| 8 | 4,672 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |
| 9 | 6,535 | I/O Efficient ECC Graph Decomposition via Graph Reduction | 2016 | VLDB |
| 10 | 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |