Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs

Summary: Shows a novel link between density decomposition and LDS and develops static algorithms using network-flow + divide-and-conquer reducing worst-case time from O(m^2) to O(m^{3/2} log p) (p small in practice). Presents three dynamic algorithms with O(m) time complexity and validates efficiency, scalability, and effectiveness on large real-world graphs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID: 13514
Venue: VLDB
Year: 2024
Pagerank: 5.1725247e-05
Overall Rank: 11,051 | 23.20%
DOI: 10.14778/3681954.3681974

Incoming Non-self Citations Over Time

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

Authors

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
10,500	Integral Densest Subgraph Search on Directed Graphs	2025	SIGMOD	5.1725247e-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.00034018471
202	Querying K-Truss Community in Large and Dynamic Graphs	2014	SIGMOD	0.00025608916
270	3-HOP: A High-Compression Indexing Scheme for Reachability Query	2009	SIGMOD	0.00022892419
646	Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis	2013	VLDB	0.00015514454
812	Streaming Algorithms for k-core Decomposition	2013	VLDB	0.00013910201
1,128	Truss-based Community Search: a Truss-equivalence Based Indexing Approach	2017	VLDB	0.00012139459
1,350	KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs	2020	VLDB	0.00011168745
1,574	Local Algorithms for Hierarchical Dense Subgraph Discovery	2019	VLDB	0.00010374281
1,654	Distance-generalized Core Decomposition	2019	SIGMOD	0.00010178111
2,152	Fast Hierarchy Construction for Dense Subgraphs	2017	VLDB	9.1341734e-05
3,460	Finding Locally Densest Subgraphs: A Convex Programming Approach	2022	VLDB	7.470212e-05
3,750	Scaling Up k-Clique Densest Subgraph Detection	2023	SIGMOD	7.2079059e-05
3,962	When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks	2017	VLDB	7.0625443e-05
4,867	A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery	2022	SIGMOD	6.534803e-05
5,294	Maximal Defective Clique Enumeration	2023	SIGMOD	6.34833e-05
5,830	Efficiently Computing k-Edge Connected Components via Graph Decomposition	2013	SIGMOD	6.132672e-05
6,734	Theoretically and Practically Efficient Parallel Nucleus Decomposition	2022	VLDB	5.8451703e-05
8,507	A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition	2022	VLDB	5.4820925e-05
9,637	Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery	2023	SIGMOD	5.3018378e-05
9,950	Parallel Colorful h-star Core Maintenance in Dynamic Graphs	2023	VLDB	5.226858e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
604	Densest Subgraph in Streaming and MapReduce	2012	VLDB	0.00015970498
2,152	Fast Hierarchy Construction for Dense Subgraphs	2017	VLDB	9.1341734e-05
9,551	An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery	2024	SIGMOD	5.316206e-05
10,072	Efficient and Scalable Directed Densest Subgraph Discovery	2026	SIGMOD	5.1725247e-05
10,544	In-depth Analysis of Densest Subgraph Discovery in a Unified Framework	2025	VLDB	5.1725247e-05
2,306	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	8.8599547e-05
5,830	Efficiently Computing k-Edge Connected Components via Graph Decomposition	2013	SIGMOD	6.132672e-05
10,500	Integral Densest Subgraph Search on Directed Graphs	2025	SIGMOD	5.1725247e-05
10,385	Density Decomposition of Bipartite Graphs	2025	SIGMOD	5.1725247e-05
3,690	Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs	2020	SIGMOD	7.2600845e-05