Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs

Summary: Links density decomposition to locally-densest-subgraph decomposition, enabling network-flow/divide-and-conquer algorithms. Reduces static complexity from O(m²) to O(m^(3/2) log p) and supports dynamic updates in O(m), yielding fewer, more meaningful dense layers. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 13701
Venue: VLDB
Year: 2024
Pagerank: 5.093636e-05
Overall Rank: 11,256 | 22.78%
DOI: 10.14778/3681954.3681974

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Yalong Zhang (Beijing Institute of Technology)
2. Rong-Hua Li (Beijing Institute of Technology)
3. Qi Zhang (Beijing Institute of Technology)
4. Hongchao Qin (Beijing Institute of Technology)
5. Guoren Wang (Beijing Institute of Technology)

BibTeX Citation

@article{zhang_vldb24,
        title = {{Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs}},
        author = {Zhang, Yalong and Li, Rong-Hua and Zhang, Qi and Qin, Hongchao and Wang, Guoren},
        journal = {PVLDB},
        series = {{VLDB} '24},
        volume = {17},
        number = {11},
        pages = {2933--2945},
        doi = {10.14778/3681954.3681974},
        url = {https://doi.org/10.14778/3681954.3681974},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,767	Integral Densest Subgraph Search on Directed Graphs	2025	SIGMOD	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 20 of 20 cited papers.

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

Rank	Cited Paper	Year	Venue	Pagerank
102	Truss Decomposition in Massive Networks	2012	VLDB	0.00034255289
189	Querying K-Truss Community in Large and Dynamic Graphs	2014	SIGMOD	0.00026114928
269	3-HOP: A High-Compression Indexing Scheme for Reachability Query	2009	SIGMOD	0.00022786599
590	Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis	2013	VLDB	0.0001605572
793	Streaming Algorithms for k-core Decomposition	2013	VLDB	0.00013978774
1,069	Truss-based Community Search: a Truss-equivalence Based Indexing Approach	2017	VLDB	0.00012323497
1,307	KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs	2020	VLDB	0.00011232263
1,416	Local Algorithms for Hierarchical Dense Subgraph Discovery	2019	VLDB	0.00010839488
1,640	Distance-generalized Core Decomposition	2019	SIGMOD	0.00010153865
2,083	Fast Hierarchy Construction for Dense Subgraphs	2017	VLDB	9.1976617e-05
3,148	Finding Locally Densest Subgraphs: A Convex Programming Approach	2022	VLDB	7.707548e-05
3,613	Scaling Up k-Clique Densest Subgraph Detection	2023	SIGMOD	7.2572837e-05
4,008	When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks	2017	VLDB	6.9619668e-05
4,903	A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery	2022	SIGMOD	6.4520708e-05
5,133	Maximal Defective Clique Enumeration	2023	SIGMOD	6.3533812e-05
5,540	Efficiently Computing k-Edge Connected Components via Graph Decomposition	2013	SIGMOD	6.1809407e-05
6,368	Theoretically and Practically Efficient Parallel Nucleus Decomposition	2022	VLDB	5.8975125e-05
8,623	A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition	2022	VLDB	5.3984824e-05
8,822	Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery	2023	SIGMOD	5.3624668e-05
10,100	Parallel Colorful h-star Core Maintenance in Dynamic Graphs	2023	VLDB	5.1488731e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	2,083	Fast Hierarchy Construction for Dense Subgraphs	2017	VLDB
2	9,696	An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery	2024	SIGMOD
3	10,363	Efficient and Scalable Directed Densest Subgraph Discovery	2026	SIGMOD
4	10,226	Efficient Anchored Densest Subgraph Discovery: Improved Time Complexity and Practical Performance	2026	SIGMOD
5	10,807	In-depth Analysis of Densest Subgraph Discovery in a Unified Framework	2025	VLDB
6	2,024	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB
7	5,540	Efficiently Computing k-Edge Connected Components via Graph Decomposition	2013	SIGMOD
8	10,767	Integral Densest Subgraph Search on Directed Graphs	2025	SIGMOD
9	9,689	Density Decomposition of Bipartite Graphs	2025	SIGMOD
10	3,737	Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs	2020	SIGMOD