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
Parents
15
Spanning trees in a fractal scale-free lattice
Zhongzhi Zhang, Hongxiao Liu, Bin Wu et al. · Physical Review E · 2011 · 70 citations
1–5 of 15
31
3
h-index
2
h-index
2
h-index
1
h-index
1
h-index
1–5 of 31
25

TU Wien
Vienna, Austria
3 h-index
3 publications
170 citations
The Abdus Salam International Centre for Theoretical Physics (ICTP)
Trieste, Italy
2 h-index
5 publications
502 citations

Sapienza University of Rome
Rome, Italy
2 h-index
3 publications
156 citations

Centre National de la Recherche Scientifique
Paris, France
2 h-index
3 publications
76 citations
Université Paris-Sud
Orsay, France
2 h-index
3 publications
76 citations

Santa Fe Institute
Santa Fe, United States
1 h-index
1 publications
16 citations
Tsinghua University
Beijing, China
1 h-index
3 publications
39 citations
University of Vienna
Vienna, Austria
1 h-index
1 publications
147 citations
1–8 of 25
PRE · 4 publications · 188 citations
4
h-index
1 publications · 147 citations
1
h-index
1 publications · 11 citations
1
h-index
1 publications · 60 citations
1
h-index
1 publications · 17 citations
1
h-index
1–5