K-core Decomposition
K-Core Decomposition is a graph-theoretic method that identifies maximal subgraphs in which each vertex is connected to at least k other vertices within the subgraph, thereby revealing the hierarchical core structure of a network.
174
Publications
10.5K
Citations
416
Authors
222
Institutions
Publications per year
2017–2026
72
174
Truss decomposition in massive networks
Jia Wang, James Cheng · Proceedings of the VLDB Endowment · 2012 · 421 citations
Anatomy of an online misinformation network
Chengcheng Shao, Pik-Mai Hui, Lei Wang et al. · PLoS ONE · 2018 · 278 citations · Full text
Social Sciences, Political Communication, Political Science +17
1–5 of 174
416
16
h-index
15
h-index
11
h-index
11
h-index
10
h-index
1–5 of 416
222

UNSW Sydney
Sydney, Australia
17 h-index
43 publications
2.2K citations
University of Technology Sydney
Sydney, Australia
14 h-index
30 publications
1.6K citations
Guangzhou University
Guangzhou, China
8 h-index
13 publications
543 citations

University of Toronto
Toronto, Canada
5 h-index
6 publications
186 citations
Chinese University of Hong Kong
Hong Kong, Hong Kong
5 h-index
6 publications
671 citations
École Polytechnique
Palaiseau, France
5 h-index
14 publications
1K citations

East China Normal University
Shanghai, China
5 h-index
10 publications
590 citations
Zhejiang Gongshang University
Hangzhou, China
5 h-index
21 publications
578 citations
1–8 of 222
PVLDB · 12 publications · 1.4K citations
12
h-index
Repository · 8 publications · 956 citations
8
h-index
6 publications · 685 citations
6
h-index
TKDE · 4 publications · 269 citations
4
h-index
NJP · 3 publications · 203 citations
3
h-index
1–5