Fast Algorithms for Core Maximization on Large Graphs
Summary: FastCM+ partitions the (k−1)-shell into components and processes them independently to maximize the k-core with b inserted edges. It extends to (k−λ)-shell conversions (2≤λ≤k) and uses dynamic programming (DP) to fuse component results, delivering faster, higher-quality solutions on large graphs than prior heuristics. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,246 | Anchored Maximum Communities over Large Directed Graphs | 2026 | VLDB | 4.1945683e-05 |
| 10,596 | Truss Decomposition in Hypergraphs | 2025 | VLDB | 4.1945683e-05 |
| 11,141 | Expanding Reverse Nearest Neighbors | 2024 | VLDB | 4.1945683e-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 |
|---|---|---|---|---|
| 738 | Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis | 2013 | VLDB | 0.00017435236 |
| 966 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB | 0.00014960672 |
| 3,273 | Global Reinforcement of Social Networks: The Anchored Coreness Problem | 2020 | SIGMOD | 7.2956944e-05 |
| 4,394 | When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks | 2017 | VLDB | 6.224902e-05 |
| 4,728 | OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks | 2017 | VLDB | 5.968586e-05 |
| 4,843 | Butterfly-Core Community Search over Labeled Graphs | 2021 | VLDB | 5.8823824e-05 |
| 6,141 | Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs | 2021 | VLDB | 5.1903263e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,146 | Accelerating Core Decomposition in Billion-Scale Hypergraphs | 2025 | SIGMOD | 4.3849295e-05 |
| 6,588 | Efficient Progressive Minimum k-Core Search | 2020 | VLDB | 5.0020648e-05 |
| 6,513 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB | 5.0321577e-05 |
| 6,141 | Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs | 2021 | VLDB | 5.1903263e-05 |
| 10,363 | A Local Search Approach to Efficient (k, p)-Core Maintenance | 2025 | SIGMOD | 4.1945683e-05 |
| 1,836 | Distance-generalized Core Decomposition | 2019 | SIGMOD | 0.00010365753 |
| 3,321 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 7.223972e-05 |
| 4,394 | When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks | 2017 | VLDB | 6.224902e-05 |
| 966 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB | 0.00014960672 |
| 10,246 | Anchored Maximum Communities over Large Directed Graphs | 2026 | VLDB | 4.1945683e-05 |