Spanning Tree Optimization is a network optimization method that identifies a minimal-cost spanning tree within a connected graph, distinguished by its focus on constructing a cycle-free subgraph that links all vertices with the lowest total edge weight.
231
Publications
10.7K
Citations
443
Authors
257
Institutions
Publications per year
2017–2026
34
Parents
Publications
231
Minimum cost spanning tree games
Daniel Granot, Gur Huberman · Mathematical Programming · 1981 · 268 citations
Optimum Communication Spanning Trees
T. C. Hu · SIAM Journal on Computing · 1974 · 268 citations
1–5 of 231
Authors
443
- GB
10
h-index
- JV
6
h-index
- HI
5
h-index
- PMPedro Martins
Instituto Superior de Contabilidade e Administração de Coimbra, Portugal
4 publications · 102 citations
4
h-index
- PT
4
h-index
1–5 of 443
Institutions
257
Universidade de Vigo
Vigo, Spain
11 h-index
23 publications
538 citations
The University of Osaka
Osaka, Japan
5 h-index
9 publications
493 citations
Universidade Federal Fluminense
Niterói, Brazil
5 h-index
10 publications
257 citations
Centre National de la Recherche Scientifique
Paris, France
5 h-index
9 publications
264 citations
Bilkent University
Ankara, Türkiye
5 h-index
9 publications
604 citations
Université Paris Dauphine-PSL
Paris, France
4 h-index
7 publications
201 citations
University of Bologna
Bologna, Italy
4 h-index
8 publications
136 citations
Universidade Estadual de Campinas (UNICAMP)
Campinas, Brazil
4 h-index
10 publications
215 citations
1–8 of 257
Venues
- European Journal of Operational Research
26 publications · 1K citations
18
h-index
- Computers & Operations Research
15 publications · 505 citations
12
h-index
- Discrete Applied Mathematics
10 publications · 308 citations
10
h-index
- Networks
9 publications · 607 citations
9
h-index
- Information Processing Letters
5 publications · 358 citations
5
h-index
1–5