Parallel Minimum Spanning Tree
A Parallel Minimum Spanning Tree is a computational method that belongs to the class of parallel graph algorithms, specifically distinguished by its ability to construct a minimum spanning tree in a weighted undirected graph by simultaneously processing multiple edges using concurrent computational resources.
23
Publications
614
Citations
45
Authors
32
Institutions
Publications per year
2017–2026
1
23
A parallel algorithm for computing minimum spanning trees
D. Barton Johnson, Panagiotis Metaxas · 1992 · 40 citations
Practical parallel algorithms for minimum spanning trees
F. Dehne, Silvia Götz · 2002 · 37 citations
1–5 of 23
45
3
h-index
3
h-index
2
h-index
2
h-index
1
h-index
1–5 of 45
32

Paderborn University
Paderborn, Germany
2 h-index
3 publications
71 citations
Carnegie Mellon University
Pittsburgh, United States
2 h-index
4 publications
46 citations
Dartmouth College
Hanover, United States
1 h-index
2 publications
60 citations
State University of New York
Albany, United States
1 h-index
2 publications
36 citations
University of Wisconsin–Madison
Madison, United States
1 h-index
2 publications
132 citations

National Yang Ming Chiao Tung University
Hsinchu, Taiwan
1 h-index
1 publications
13 citations
Kansas City University
Kansas City, United States
1 h-index
2 publications
20 citations
University of New Mexico
Albuquerque, United States
1 h-index
2 publications
62 citations
1–8 of 32
3 publications · 129 citations
3
h-index
2 publications · 28 citations
2
h-index
2 publications · 35 citations
2
h-index
1 publications · 30 citations
1
h-index
JACM · 1 publications · 68 citations
1
h-index
1–5