Node Contraction

Node Contraction is a graph simplification operation in multilevel graph visualization that belongs to the class of hierarchical abstraction techniques, specifically characterized by the fusion of selected nodes and their incident edges into a single supernode to reduce graph complexity while preserving structural properties.

45

Publications

1.9K

Citations

110

Authors

58

Institutions

Publications per year

2017–2026

10

Variants

Node Merging

Authors

110

  1. PV
    Pim van ’t Hof

    University of Bergen, Norway

    3 publications · 82 citations

    3

    h-index

  2. DM
    Dimitrios M. Thilikos

    National and Kapodistrian University of Athens, Greece

    3 publications · 141 citations

    3

    h-index

  3. PA
    Petr A. Golovach

    University of Bergen, Norway

    2 publications · 103 citations

    2

    h-index

  4. LM
    Lee M. Gunderson

    Princeton Plasma Physics Laboratory, United States

    2 publications · 39 citations

    2

    h-index

  5. DP
    Daniël Paulusma

    Durham University, United Kingdom

    2 publications · 59 citations

    2

    h-index

1–5 of 110

Venues

  1. Discrete Applied Mathematics

    4 publications · 92 citations

    4

    h-index

  2. Discrete Mathematics

    4 publications · 81 citations

    4

    h-index

  3. Journal of Combinatorial Theory Series B

    3 publications · 203 citations

    3

    h-index

  4. DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)

    Repository · 2 publications · 40 citations

    2

    h-index

  5. 1

    h-index

1–5