Minimum Spanning Tree Construction is a graph-theoretic algorithmic method that, given a connected, undirected graph with weighted edges, computes a spanning tree of minimum total edge weight, distinguished by its reliance on greedy selection strategies to ensure acyclicity and connectivity in the resulting subgraph.
300
Publications
21.2K
Citations
739
Authors
379
Institutions
Publications per year
2017–2026
51
Parents
Publications
300
The Traveling-Salesman Problem and Minimum Spanning Trees
Michael Held, Richard M. Karp · Operations Research · 1970 · 1.4K citations
1–5 of 300
Authors
739
- RE
8
h-index
- DP
7
h-index
- CK
5
h-index
- NS
4
h-index
- BP
4
h-index
1–5 of 739
Institutions
379
Northwestern University
Evanston, United States
8 h-index
12 publications
701 citations
IBM (United States)
Armonk, United States
7 h-index
12 publications
829 citations
University of Illinois Urbana-Champaign
Urbana, United States
5 h-index
5 publications
265 citations
Weizmann Institute of Science
Rehovot, Israel
5 h-index
5 publications
388 citations
Yale University
New Haven, United States
5 h-index
7 publications
596 citations
IBM Research - Thomas J. Watson Research Center
Yorktown Heights, United States
5 h-index
10 publications
1.2K citations
Tel Aviv University
Tel Aviv, Israel
5 h-index
7 publications
788 citations
AT&T (United States)
Bedminster, United States
5 h-index
8 publications
774 citations
1–8 of 379
Venues
- Physica A Statistical Mechanics and its Applications
10 publications · 475 citations
10
h-index
- IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
8 publications · 1K citations
8
h-index
- SIAM Journal on Computing
8 publications · 1.6K citations
8
h-index
- Information Processing Letters
6 publications · 282 citations
6
h-index
- Algorithmica
5 publications · 91 citations
5
h-index
1–5