Algorithm 613: Minimum Spanning Tree for Moderate Integer Weights

DOI10.1145/356068.356077MaRDI QIDQ3327729zbMATH OpenOpenAlexFDO

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

Publication date 1984

Published in ACM Transactions on Mathematical Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/356068.356077

zbMATH Keywords

minimum spanning treeshortest connection network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Software, source code, etc. for problems pertaining to combinatorics (05-04) Software, source code, etc. for problems pertaining to computer science (68-04)

Cited in

(2)

• Computational experience with minimum spanning tree algorithms
• An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem

This page was built for publication: Algorithm 613: Minimum Spanning Tree for Moderate Integer Weights

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