Minimal spanning trees: An empirical investigation of parallel algorithms

DOI10.1016/0167-8191(89)90005-7zbMath0681.68086OpenAlexW2076802814MaRDI QIDQ1823705

R. V. Helgaon, Jeffrey L. Kennington, Richard S. Barr

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 theoryminimum spanning tree problemPrim's algorithmKruskal's algorithmSequent Symmetry S81 multicomputerSollin's algorithm

Mathematics Subject Classification ID

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

Related Items (2)

Parallel Algorithms for Minimum Spanning Tree Problem ⋮ Optimality conditions in preference-based spanning tree problems

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