Database Paper Browser

Back to papers

Efficient Parallel D-core Decomposition at Scale

Summary: Proposes multicore parallel algorithms for full D-core ((k,l)-core) decomposition using implicit level-by-level vertex removal per k to reduce dependencies while keeping sequential-like time complexity. Introduces D-shell to prune redundant k-values and derive larger-k D-cores, achieving up to 100× speedup over prior parallel methods on 32 threads for large graphs. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13490
Venue
VLDB
Year
2024
Pagerank
5.0273291e-05
Overall Rank
6,509 | 54.77%
DOI
10.14778/3675034.3675054

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 4 of 4 citing papers.

Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 22 of 22 cited papers.

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

Rank Cited Paper Year Venue Pagerank
106 Truss Decomposition in Massive Networks 2012 VLDB 0.00048373761
284 Querying K-Truss Community in Large and Dynamic Graphs 2014 SIGMOD 0.00029014359
888 Maximum Biclique Search at Billion Scale 2020 VLDB 0.00015549756
966 Streaming Algorithms for k-core Decomposition 2013 VLDB 0.00014947141
1,150 K-Core Decomposition of Large Networks on a Single PC 2016 VLDB 0.00013647447
1,641 Truss-based Community Search over Large Directed Graphs 2020 SIGMOD 0.00011044805
2,043 Local Algorithms for Hierarchical Dense Subgraph Discovery 2019 VLDB 9.6970812e-05
2,291 Effective and Efficient Community Search over Large Heterogeneous Information Networks 2020 VLDB 9.0894835e-05
2,685 Truss Decomposition of Probabilistic Graphs: Semantics and Algorithms 2016 SIGMOD 8.314724e-05
2,908 (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs 2022 VLDB 7.92992e-05
2,913 Efficient Algorithms for Densest Subgraph Discovery 2019 VLDB 7.9229304e-05
4,133 On Querying Historical K-Cores 2021 VLDB 6.4185206e-05
4,341 Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs 2020 SIGMOD 6.268429e-05
4,737 Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions 2021 SIGMOD 5.9529218e-05
5,302 Distributed D-core Decomposition over Large Directed Graphs 2022 VLDB 5.5746393e-05
5,909 Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach 2022 SIGMOD 5.2722596e-05
6,185 Efficient Core Maintenance in Large Bipartite Graphs 2023 SIGMOD 5.1618114e-05
6,206 Efficiently Computing k-Edge Connected Components via Graph Decomposition 2013 SIGMOD 5.1522897e-05
6,729 Maximal D-truss Search in Dynamic Directed Graphs 2023 VLDB 4.943658e-05
6,882 Theoretically and Practically Efficient Parallel Nucleus Decomposition 2022 VLDB 4.8923998e-05
9,409 A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery 2024 SIGMOD 4.3399748e-05
11,413 Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques 2022 VLDB 4.1905499e-05
Previous Page 1 / 1 Next

Semantically Similar Papers