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 | 5.1725247e-05 |
| 10,604 | Truss Decomposition in Hypergraphs | 2025 | VLDB | 5.1725247e-05 |
| 11,144 | Expanding Reverse Nearest Neighbors | 2024 | VLDB | 5.1725247e-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 |
|---|---|---|---|---|
| 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 |
| 3,962 | When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks | 2017 | VLDB | 7.0625443e-05 |
| 4,192 | Butterfly-Core Community Search over Labeled Graphs | 2021 | VLDB | 6.9070287e-05 |
| 4,266 | Global Reinforcement of Social Networks: The Anchored Coreness Problem | 2020 | SIGMOD | 6.8607427e-05 |
| 4,421 | OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks | 2017 | VLDB | 6.7748547e-05 |
| 5,649 | Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs | 2021 | VLDB | 6.1999762e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,160 | Accelerating Core Decomposition in Billion-Scale Hypergraphs | 2025 | SIGMOD | 5.371468e-05 |
| 6,280 | Efficient Progressive Minimum k-Core Search | 2020 | VLDB | 5.9921635e-05 |
| 6,514 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB | 5.9114568e-05 |
| 5,649 | Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs | 2021 | VLDB | 6.1999762e-05 |
| 10,375 | A Local Search Approach to Efficient (k, p)-Core Maintenance | 2025 | SIGMOD | 5.1725247e-05 |
| 1,654 | Distance-generalized Core Decomposition | 2019 | SIGMOD | 0.00010178111 |
| 2,807 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 8.158882e-05 |
| 3,962 | When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks | 2017 | VLDB | 7.0625443e-05 |
| 812 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB | 0.00013910201 |
| 10,246 | Anchored Maximum Communities over Large Directed Graphs | 2026 | VLDB | 5.1725247e-05 |