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
45
Graph expressions and graph rewritings
Michel Bauderon, Bruno Courcelle · Theory of Computing Systems · 1987 · 238 citations
Very Simple Methods for All Pairs Network Flow Analysis
Dan Gusfield · SIAM Journal on Computing · 1990 · 191 citations
1–5 of 45
110
3
h-index
National and Kapodistrian University of Athens, Greece
3 publications · 141 citations
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 110
58

National and Kapodistrian University of Athens
Athens, Greece
4 h-index
5 publications
161 citations

Centre National de la Recherche Scientifique
Paris, France
3 h-index
4 publications
296 citations
University of Bergen
Bergen, Norway
3 h-index
6 publications
190 citations

Durham University
Durham, United Kingdom
3 h-index
5 publications
200 citations
Karlsruhe Institute of Technology
Karlsruhe, Germany
2 h-index
4 publications
186 citations
Université Libre de Bruxelles
Brussels, Belgium
2 h-index
2 publications
59 citations

Weizmann Institute of Science
Rehovot, Israel
2 h-index
4 publications
238 citations
University of Michigan
Ann Arbor, United States
2 h-index
2 publications
22 citations
1–8 of 58
4 publications · 92 citations
4
h-index
4 publications · 81 citations
4
h-index
3 publications · 203 citations
3
h-index
Repository · 2 publications · 40 citations
2
h-index
1 publications · 21 citations
1
h-index
1–5