Concepedia

Parallel Minimum Spanning Tree Algorithms

Parallel Minimum Spanning Tree Algorithms is a class of parallel graph algorithms designed to efficiently compute a minimum spanning tree in a weighted undirected graph by concurrently processing multiple edges or subtrees, thereby reducing computational time through distributed or shared-memory parallelism.

43

Publications

1.8K

Citations

85

Authors

57

Institutions

Publications per year

2017–2026

1

Parents

Publications

43

Approximate and exact parallel scheduling with applications to list, tree and graph problems

Richard Cole, Uzi Vishkin · 1986 · 176 citations

, , +15

Parallel algorithms for geometric graph problems

Alexandr Andoni, Aleksandar Nikolov, Krzysztof Onak et al. · 2014 · 131 citations

, , +17

Fast, Efficient Parallel Algorithms for Some Graph Problems

Carla D. Savage, Joseph F. JáJá · SIAM Journal on Computing · 1981 · 110 citations

, , +15

A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs)

David A. Bader, Guojing Cong · Journal of Parallel and Distributed Computing · 2005 · 102 citations · Full text

, , +12

Parallel algorithms for the connected components and minimal spanning tree problems

Dhruva Nath, Sachin Maheshwari · Information Processing Letters · 1982 · 82 citations

, , +15

1–5 of 43

Authors

85

  1. DA
    David A. Bader

    Georgia Institute of Technology, United States

    4 publications · 174 citations

    4

    h-index

  2. PM
    Panagiotis Metaxas

    Wellesley College, United States

    3 publications · 83 citations

    3

    h-index

  3. DB
    D. Barton Johnson

    Pennsylvania State University, United States

    3 publications · 83 citations

    3

    h-index

  4. RE
    Robert E. Tarjan

    Princeton University, United States

    3 publications · 117 citations

    3

    h-index

  5. RC
    Richard Cole

    New York University, United States

    3 publications · 276 citations

    3

    h-index

1–5 of 85

Institutions

57

  1. Carnegie Mellon University

    Pittsburgh, United States

    4 h-index

    10 publications

    394 citations

  2. Georgia Institute of Technology

    Atlanta, United States

    3 h-index

    5 publications

    184 citations

  3. Princeton University

    Princeton, United States

    3 h-index

    4 publications

    184 citations

  4. Paderborn University

    Paderborn, Germany

    2 h-index

    3 publications

    71 citations

  5. John Brown University

    Siloam Springs, United States

    2 h-index

    2 publications

    206 citations

  6. University of Hong Kong

    Pok Fu Lam, Hong Kong

    2 h-index

    3 publications

    148 citations

  7. IBM (United States)

    Armonk, United States

    2 h-index

    2 publications

    233 citations

  8. Indian Institute of Technology Delhi

    New Delhi, India

    1 h-index

    2 publications

    164 citations

1–8 of 57

Venues

  1. Parallel Computing

    3 publications · 87 citations

    3

    h-index

  2. Information Processing Letters

    3 publications · 129 citations

    3

    h-index

  3. Defense Technical Information Center (DTIC)

    Repository · 2 publications · 50 citations

    2

    h-index

  4. Algorithmica

    2 publications · 35 citations

    2

    h-index

  5. Journal of Algorithms

    2 publications · 103 citations

    2

    h-index

1–5