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

Authors

45

  1. PM
    Panagiotis Metaxas

    Wellesley College, United States

    3 publications · 83 citations

    3

    h-index

  2. DB
    D. Barton Johnson

    Pennsylvania State University, United States

    3 publications · 83 citations

    3

    h-index

  3. SP
    Shaunak Pawagi

    Stony Brook University, United States

    2 publications · 43 citations

    2

    h-index

  4. RE
    Robert E. Tarjan

    Princeton University, United States

    2 publications · 42 citations

    2

    h-index

  5. IV
    I. V. Ramakrishnan

    Stony Brook University, United States

    1 publications · 25 citations

    1

    h-index

1–5 of 45

Venues

  1. Information Processing Letters

    3 publications · 129 citations

    3

    h-index

  2. Parallel Computing

    2 publications · 28 citations

    2

    h-index

  3. Algorithmica

    2 publications · 35 citations

    2

    h-index

  4. Journal of Algorithms

    1 publications · 30 citations

    1

    h-index

  5. Journal of the ACM

    JACM · 1 publications · 68 citations

    1

    h-index

1–5