Minimal spanning trees: An empirical investigation of parallel algorithms

DOI10.1016/0167-8191(89)90005-7MaRDI QIDQ1823705zbMATH OpenOpenAlexFDO

Authors R. V. Helgaon, Richard S. Barr, Jeffery L. Kennington

Publication date 1989

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(89)90005-7

zbMATH Keywords

performancemeasurementsgraph theoryPrim's algorithmminimum spanning tree problemKruskal's algorithmSequent Symmetry S81 multicomputerSollin's algorithm

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Theory of software (68N99) Theory of operating systems (68N25)

Recommendations

• Computational Methods for Minimum Spanning Tree Algorithms
• Parallel Algorithms for Minimum Spanning Tree Problem
• Improving the efficiency of parallel minimum spanning tree algorithms
• A Parallel Algorithm for Computing Minimum Spanning Trees
• Performance of parallel spanning tree algorithms on linear arrays of transputers and Unix systems

Cited in

(10)

• Comparison of the Prim-Dijkstra and Kraskal algorithms on an associative parallel processor
• Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees
• scientific article; zbMATH DE number 1629846 (Why is no real title available?)
• Optimality conditions in preference-based spanning tree problems
• An \(O(\log m)\) parallel algorithm for the minimum spanning tree problem
• Parallel construction of multiple independent spanning trees on highly scalable datacenter networks
• Computational Methods for Minimum Spanning Tree Algorithms
• A data-parallel algorithm for minimum-width tree layout
• Parallel Algorithms for Minimum Spanning Tree Problem
• scientific article; zbMATH DE number 177565 (Why is no real title available?)

This page was built for publication: Minimal spanning trees: An empirical investigation of parallel algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1823705)