Graph Coarsening

Graph Coarsening is a graph transformation technique that reduces the size of a graph by merging nodes and edges into super-nodes and super-edges while preserving the graph’s structural and semantic properties to facilitate efficient computation in graph-based learning tasks.

56

Publications

4.5K

Citations

160

Authors

88

Institutions

Publications per year

2017–2026

43

Authors

160

  1. PL
    Píetro Lió

    University of Cambridge, United Kingdom

    4 publications · 259 citations

    4

    h-index

  2. PL
    Pengfei Liu

    Tsinghua University, China

    2 publications · 32 citations

    2

    h-index

  3. CS
    Christian Schulz

    Karlsruhe Institute of Technology, Germany

    2 publications · 86 citations

    2

    h-index

  4. ZY
    Zihao Ye

    South China Agricultural University, China

    2 publications · 68 citations

    2

    h-index

  5. PS
    Peter Sanders

    Karlsruhe Institute of Technology, Germany

    2 publications · 86 citations

    2

    h-index

1–5 of 160

Venues

  1. arXiv (Cornell University)

    Repository · 10 publications · 351 citations

    10

    h-index

  2. IEEE Transactions on Knowledge and Data Engineering

    TKDE · 2 publications · 49 citations

    2

    h-index

  3. Proceedings of the AAAI Conference on Artificial Intelligence

    Conference · 2 publications · 110 citations

    2

    h-index

  4. HAL (Le Centre pour la Communication Scientifique Directe)

    Repository · 1 publications · 50 citations

    1

    h-index

  5. Applied Intelligence

    1 publications · 19 citations

    1

    h-index

1–5