DBScholar

Back to papers

Scaling Up Density Decomposition on Massive Graphs

Summary: Introduces MeanDC and CoreDC to cut max-flow work via mean pivots and k-core prepartitioning, then parallel HeatDC/CoreHeatDC to extract layers with edge-local heat diffusion. CoreHeatDC decomposes graphs with 1.81B edges in hundreds of seconds. (summarized by gpt-6-luna on Oct 22 2026)

Paper ID
hffd925e5474ff680
Venue
SIGMOD
Year
2027
Pagerank
4.9605343e-05
Overall Rank
10,407 | 30.25%
DOI
10.1145/3837122
PDF
Download (CC BY 4.0)

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{zhang_sigmod27,
        title = {{Scaling Up Density Decomposition on Massive Graphs}},
        author = {Zhang, Yalong and Li, Rong-Hua and Zhang, Qi and Jiang, Jiaqi and Dai, Qiangqiang and Wang, Guoren},
        series = {{SIGMOD} '27},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3837122},
        url = {https://dl.acm.org/doi/10.1145/3837122},
        year = {2027}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 18 of 18 cited papers.

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

Rank Cited Paper Year Venue Pagerank
96 Truss Decomposition in Massive Networks 2012 VLDB 0.00034261728
182 Querying K-Truss Community in Large and Dynamic Graphs 2014 SIGMOD 0.00026383593
269 3-HOP: A High-Compression Indexing Scheme for Reachability Query 2009 SIGMOD 0.00022625826
580 Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis 2013 VLDB 0.00016057466
732 Streaming Algorithms for k-core Decomposition 2013 VLDB 0.00014341313
1,045 Truss-based Community Search: a Truss-equivalence Based Indexing Approach 2017 VLDB 0.00012318828
1,398 Local Algorithms for Hierarchical Dense Subgraph Discovery 2019 VLDB 0.0001076734
2,005 Fast Hierarchy Construction for Dense Subgraphs 2017 VLDB 9.1851569e-05
2,926 Finding Locally Densest Subgraphs: A Convex Programming Approach 2022 VLDB 7.837861e-05
3,863 When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks 2017 VLDB 6.9488207e-05
4,567 Efficiently Computing k-Edge Connected Components via Graph Decomposition 2013 SIGMOD 6.5173666e-05
5,575 Theoretically and Practically Efficient Parallel Nucleus Decomposition 2022 VLDB 6.0626208e-05
7,891 A Near-Optimal Approach to Edge Connectivity-Based Hierarchical Graph Decomposition 2022 VLDB 5.4156949e-05
9,604 Efficient Algorithms for Pseudoarboricity Computation in Large Static and Dynamic Graphs 2024 VLDB 5.1376962e-05
9,762 Faster and Efficient Density Decomposition via Proportional Response with Exponential Momentum 2025 SIGMOD 5.115551e-05
9,906 Density Decomposition of Bipartite Graphs 2025 SIGMOD 5.0983269e-05
9,957 Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs 2024 VLDB 5.0910746e-05
10,291 Integral Densest Subgraph Search on Directed Graphs 2025 SIGMOD 5.031399e-05
Previous Page 1 / 1 Next

Semantically Similar Papers