Parallelization of Minimum Spanning Tree Algorithms Using Distributed Memory Architectures

2014/01/01 by Vladimir Lončar, Srdjan Škrbić, Antun Balaž · 1 citation
Computer Science · Mathematics · #Advanced Database Systems and Queries #Algorithm #Combinatorics #Complexity and Algorithms in Graphs #Computer science #Discrete mathematics #Distributed minimum spanning tree #Mathematics #Minimum spanning tree #Parallel Computing and Optimization Techniques #Parallel computing #Spanning tree #Tree (set theory)

paper · doi:10.1007/978-94-017-8832-8_39

crossref issued 2014/01/01 · crossref published 2014/01/01 · crossref published-print 2014/01/01 · openalex publication_date 2014/01/01 · crossref created 2014/04/26 · crossref published-online 2014/04/27 · crossref deposited 2025/05/02 · openalex created_date 2025/10/10 · crossref indexed 2026/05/29 · openalex updated_date 2026/08/04

Citations

• On the shortest spanning subtree of a graph and the traveling salesman problem
• Shortest Connection Networks And Some Generalizations
• A Distributed Algorithm for Minimum-Weight Spanning Trees

Cited by

• Kruskal's algorithm [wikipedia]