Fast Algorithms for Core Maximization on Large Graphs
Summary: FastCM+ accelerates NP/APX-hard k-core maximization by partitioning the (k−1)-shell, modeling complete/partial (k−λ)-shell conversions, and combining component gains via dynamic programming. Across 11 datasets, it is faster and achieves larger cores than prior heuristics. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
BibTeX Citation
@article{sun_vldb22,
title = {{Fast Algorithms for Core Maximization on Large Graphs}},
author = {Sun, Xin and Huang, Xin and Jin, Di},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {7},
pages = {1350--1362},
doi = {10.14778/3523210.3523214},
url = {https://doi.org/10.14778/3523210.3523214},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 3 of 3 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 10,534 | Anchored Maximum Communities over Large Directed Graphs | 2026 | VLDB | 5.093636e-05 |
| 10,857 | Truss Decomposition in Hypergraphs | 2025 | VLDB | 5.093636e-05 |
| 11,347 | Expanding Reverse Nearest Neighbors | 2024 | VLDB | 5.093636e-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 |
|---|---|---|---|---|
| 590 | Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis | 2013 | VLDB | 0.0001605572 |
| 793 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB | 0.00013978774 |
| 4,004 | Butterfly-Core Community Search over Labeled Graphs | 2021 | VLDB | 6.965474e-05 |
| 4,008 | When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks | 2017 | VLDB | 6.9619668e-05 |
| 4,331 | Global Reinforcement of Social Networks: The Anchored Coreness Problem | 2020 | SIGMOD | 6.7561061e-05 |
| 4,485 | OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks | 2017 | VLDB | 6.6715036e-05 |
| 5,697 | Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs | 2021 | VLDB | 6.1174514e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,301 | Accelerating Core Decomposition in Billion-Scale Hypergraphs | 2025 | SIGMOD |
| 2 | 6,342 | Efficient Progressive Minimum k-Core Search | 2020 | VLDB |
| 3 | 6,617 | Efficient Parallel D-core Decomposition at Scale | 2024 | VLDB |
| 4 | 5,697 | Local Algorithms for Distance-generalized Core Decomposition over Large Dynamic Graphs | 2021 | VLDB |
| 5 | 10,656 | A Local Search Approach to Efficient (k, p)-Core Maintenance | 2025 | SIGMOD |
| 6 | 1,640 | Distance-generalized Core Decomposition | 2019 | SIGMOD |
| 7 | 2,826 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB |
| 8 | 4,008 | When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks | 2017 | VLDB |
| 9 | 793 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB |
| 10 | 10,534 | Anchored Maximum Communities over Large Directed Graphs | 2026 | VLDB |