Graph Decimation

Graph decimation is a graph simplification method that reduces the size of a graph by selectively removing a subset of vertices or edges while preserving its essential structural properties, distinguished by its focus on maintaining spectral or topological characteristics through iterative, often hierarchical, node elimination.

15

Publications

836

Citations

31

Authors

25

Institutions

Publications per year

2017–2026

1

Authors

31

  1. WG
    Walter G. Kropatsch

    TU Wien, Austria

    3 publications · 170 citations

    3

    h-index

  2. AD
    Aurélien Decelle

    Centre National de la Recherche Scientifique, France

    2 publications · 86 citations

    2

    h-index

  3. RZ
    Riccardo Zecchina

    Politecnico di Torino, Italy

    2 publications · 215 citations

    2

    h-index

  4. SB
    S. Ben Yacoub

    TU Wien, Austria

    1 publications · 12 citations

    1

    h-index

  5. CA
    Cesare Alippi

    Politecnico di Milano, Italy

    1 publications · 60 citations

    1

    h-index

1–5 of 31

Venues

  1. Physical Review E

    PRE · 4 publications · 188 citations

    4

    h-index

  2. 1

    h-index

  3. 1

    h-index

  4. 1

    h-index

  5. Journal of Physics A Mathematical and General

    1 publications · 17 citations

    1

    h-index

1–5