Efficient Progressive Minimum k-Core Search
Summary: Progressive PSA algorithm for minimum k-core search, finding the smallest k-core containing all query vertices. Novel lower/upper bound techniques prune the search space and balance solution quality with runtime; extensive experiments on 12 real graphs demonstrate efficiency. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Conggai Li (Guangdong University of Technology; University of Technology Sydney)
- 2. Fan Zhang (Guangdong University of Technology)
- 3. Ying Zhang (University of Technology Sydney)
- 4. Lu Qin (University of Technology Sydney)
- 5. Wenjie Zhang (University of New South Wales)
- 6. Xuemin Lin (University of New South Wales)
BibTeX Citation
@article{li_vldb20,
title = {{Efficient Progressive Minimum k-Core Search}},
author = {Li, Conggai and Zhang, Fan and Zhang, Ying and Qin, Lu and Zhang, Wenjie and Lin, Xuemin},
journal = {PVLDB},
series = {{VLDB} '20},
volume = {13},
number = {3},
pages = {361--374},
doi = {10.14778/3368289.3368300},
url = {https://doi.org/10.14778/3368289.3368300},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 5 of 5 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 2,826 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 8.0865974e-05 |
| 3,395 | Efficient Size-Bounded Community Search over Large Networks | 2021 | VLDB | 7.44939e-05 |
| 4,004 | Butterfly-Core Community Search over Labeled Graphs | 2021 | VLDB | 6.965474e-05 |
| 10,349 | Budgeted Strong Community Search in Heterogeneous Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,367 | Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements | 2026 | SIGMOD | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 189 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00026114928 |
| 276 | Local Search of Communities in Large Graphs | 2014 | SIGMOD | 0.00022620623 |
| 590 | Large Scale Cohesive Subgraphs Discovery for Social Network Visual Analysis | 2013 | VLDB | 0.0001605572 |
| 706 | Effective Community Search for Large Attributed Graphs | 2016 | VLDB | 0.00014789612 |
| 2,482 | Efficient Structural Graph Clustering: An Index-Based Approach | 2018 | VLDB | 8.5183361e-05 |
| 3,261 | Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity | 2015 | SIGMOD | 7.5853837e-05 |
| 4,008 | When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks | 2017 | VLDB | 6.9619668e-05 |
| 4,485 | OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks | 2017 | VLDB | 6.6715036e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 982 | Influential Community Search in Large Networks | 2015 | VLDB |
| 2 | 10,930 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB |
| 3 | 9,519 | A Counting-based Approach for Efficient k-Clique Densest Subgraph Discovery | 2024 | SIGMOD |
| 4 | 10,367 | Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements | 2026 | SIGMOD |
| 5 | 2,024 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |
| 6 | 3,395 | Efficient Size-Bounded Community Search over Large Networks | 2021 | VLDB |
| 7 | 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 8 | 5,370 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD |
| 9 | 5,149 | An Optimal and Progressive Approach to Online Search of Top-K Influential Communities | 2018 | VLDB |
| 10 | 4,008 | When Engagement Meets Similarity: Efficient (k,r)-Core Computation on Social Networks | 2017 | VLDB |