Computational Methods for Minimum Spanning Tree Algorithms

DOI10.1137/0905012MaRDI QIDQ3323290zbMATH OpenOpenAlexFDO

Authors R. E. Haymond, James P. Jarvis, Douglas R. Shier

Publication date 1984

Published in SIAM Journal on Scientific and Statistical Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0905012

zbMATH Keywords

Computational experiencedata structuresminimum spanning treenetworks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Minimum-weight spanning tree algorithms. A survey and empirical study
• A Parallel Algorithm for Computing Minimum Spanning Trees
• scientific article; zbMATH DE number 177565
• Trans-dichotomous algorithms for minimum spanning trees and shortest paths
• Minimal spanning trees: An empirical investigation of parallel algorithms

Cited in

(21)

• Computational experience with minimum spanning tree algorithms
• An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem
• Trans-dichotomous algorithms for minimum spanning trees and shortest paths
• Minimal spanning trees: An empirical investigation of parallel algorithms
• Kruskal with embedded c-semirings to solve MST problems with partially-ordered costs
• Critical analysis of the spanning tree techniques
• scientific article; zbMATH DE number 4016592 (Why is no real title available?)
• scientific article; zbMATH DE number 989224 (Why is no real title available?)
• C-semiring Frameworks for Minimum Spanning Tree Problems
• Variations for spanning trees
• scientific article; zbMATH DE number 177565 (Why is no real title available?)
• Offline Algorithms for Dynamic Minimum Spanning Tree Problems
• scientific article; zbMATH DE number 716158 (Why is no real title available?)
• scientific article; zbMATH DE number 1069311 (Why is no real title available?)
• scientific article; zbMATH DE number 2013597 (Why is no real title available?)
• scientific article; zbMATH DE number 1487926 (Why is no real title available?)
• On the History of the Minimum Spanning Tree Problem
• Playing with Kruskal: algorithms for morphological trees in edge-weighted graphs
• Distributed Computing - IWDC 2003
• Minimum-weight spanning tree algorithms. A survey and empirical study
• Finding optimal spanning trees for damaged networks

This page was built for publication: Computational Methods for Minimum Spanning Tree Algorithms

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