Product
Help
Pricing
About
Jobs
Log in
Get started
Keyword
Add to collection
k-core
Description:
A k-core is a maximal subnetwork in which every node is connected to at least k other nodes, used to analyze network structure.
Primary topic:
Complex Network Analysis Techniques (33%)
Related topics:
Complex Network Analysis Techniques (33%),
Graph Theory and Algorithms (18%),
Limits and Structures in Graph Theory (10%)
OpenAlex ID:
keywords/k-core
k -Core Organization of Complex Networks
2006
·
S. N. Dorogovtsev
, A. V. Goltsev
, et al.
·
Physical Review Letters
·
711
PDF
Truss decomposition in massive networks
2012
·
Jia Wang
, James Cheng
·
Proceedings of the VLDB Endowment
·
441
PDF
Sudden Emergence of a Giantk-Core in a Random Graph
1996
·
Boris Pittel
, Joel Spencer
, et al.
·
Journal of Combinatorial Theory Series B
·
433
Searching for superspreaders of information in real-world social media
2014
·
Sen Pei
, Lev Muchnik
, et al.
·
Scientific Reports
·
425
PDF
Influential community search in large networks
2015
·
Rong-Hua Li
, Lu Qin
, et al.
·
Proceedings of the VLDB Endowment
·
243
Stream graphs and link streams for the modeling of interactions over time
2018
·
Matthieu Latapy
, Tiphaine Viard
, et al.
·
Social Network Analysis and Mining
·
226
PDF
The k-core as a predictor of structural collapse in mutualistic ecosystems
2018
·
Flaviano Morone
, Gino Del Ferraro
, et al.
·
Nature Physics
·
150
A complex network approach to text summarization
2008
·
Lucas Antiqueira
, Osvaldo N. Oliveira
, et al.
·
Information Sciences
·
140
When engagement meets similarity: efficient (k,r)-core computation on social networks
2017
·
Fan Zhang
, Ying Zhang
, et al.
·
Proceedings of the VLDB Endowment
·
126
PDF
On percolation in random graphs with given vertex degrees
2009
·
Svante Janson
·
Electronic Journal of Probability
·
124
PDF
Evaluating Cooperation in Communities with the k-Core Structure
2011
·
Christos Giatsidis
, Dimitrios M. Thilikos
, et al.
·
IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)
·
120
Size and connectivity of the k-core of a random graph
1991
·
Tomasz Łuczak
·
Discrete Mathematics
·
120
Preventing Unraveling in Social Networks: The Anchored $k$-Core Problem
2015
·
Kshipra Bhawalkar
, Jon Kleinberg
, et al.
·
SIAM Journal on Discrete Mathematics
·
107
Finding maximal k-edge-connected subgraphs from a large graph
2012
·
Rui Zhou
, Chengfei Liu
, et al.
·
International Conference on Extending Database Technology (EDBT)
·
107
A simple solution to the k‐core problem
2006
·
Svante Janson
, Malwina J. Luczak
·
Random Structures and Algorithms
·
103
PDF
Fractality and self-similarity in scale-free networks
2007
·
J S Kim
, K-I Goh
, et al.
·
New Journal of Physics
·
100
PDF
Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem
2017
·
Fan Zhang
, Ying Zhang
, et al.
·
Proceedings of the AAAI Conference on Artificial Intelligence
·
95
Main Core Retention on Graph-of-Words for Single-Document Keyword Extraction
2015
·
François Rousseau
, Michalis Vazirgiannis
·
Lecture notes in computer science
·
89
Identification of spreading influence nodes via multi-level structural attributes based on the graph convolutional network
2022
·
Yang Ou
, Qiang Guo
, et al.
·
Expert Systems with Applications
·
88
Identifying power elites—k-cores in heterogeneous affiliation networks
2017
·
Anton Grau Larsen
, Christoph Houman Ellersgaard
·
Social Networks
·
77
Fast hierarchy construction for dense subgraphs
2016
·
Ahmet Erdem Sariyüce
, Ali Pinar
·
Proceedings of the VLDB Endowment
·
77
PDF
Patterns and anomalies in k-cores of real-world graphs with applications
2017
·
Kijung Shin
, Tina Eliassi-Rad
, et al.
·
Knowledge and Information Systems
·
75
k-Core Organization in Complex Networks
2011
·
G. J. Baxter
, S. N. Dorogovtsev
, et al.
·
Springer optimization and its applications
·
75
ROBIN: a Graph-Theoretic Approach to Reject Outliers in Robust Estimation using Invariants
2021
·
Jingnan Shi
, Heng Yang
, et al.
·
Proceedings - IEEE International Conference on Robotics and Automation/Proceedings
·
72
PDF
Solving the Maximum Clique and Vertex Coloring Problems on Very Large Sparse Networks
2015
·
Anurag Verma
, Austin Buchanan
, et al.
·
INFORMS journal on computing
·
72
Show more works
View as search
Works count:
402
Citation count:
7,177
Year
Topic
Type