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

Authors

416

  1. XL
    Xuemin Lin

    UNSW Sydney, Australia

    17 publications · 941 citations

    16

    h-index

  2. WZ
    Wenjie Zhang

    UNSW Sydney, Australia

    16 publications · 823 citations

    15

    h-index

  3. LQ
    Lu Qin

    University of Technology Sydney, Australia

    13 publications · 687 citations

    11

    h-index

  4. YZ
    Ying Zhang

    UNSW Sydney, Australia

    12 publications · 618 citations

    11

    h-index

  5. FZ
    Fan Zhang

    UNSW Sydney, Australia

    10 publications · 429 citations

    10

    h-index

1–5 of 416

Venues

  1. Proceedings of the VLDB Endowment

    PVLDB · 12 publications · 1.4K citations

    12

    h-index

  2. arXiv (Cornell University)

    Repository · 8 publications · 956 citations

    8

    h-index

  3. Scientific Reports

    6 publications · 685 citations

    6

    h-index

  4. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 4 publications · 269 citations

    4

    h-index

  5. New Journal of Physics

    NJP · 3 publications · 203 citations

    3

    h-index

1–5