Computational Methods for Minimum Spanning Tree Algorithms

DOI10.1137/0905012zbMath0537.68069OpenAlexW2045714801MaRDI QIDQ3323290

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

networksdata structuresminimum spanning treeComputational experience

Mathematics Subject Classification ID

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

Related Items (3)

An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem ⋮ Minimum-weight spanning tree algorithms. A survey and empirical study ⋮ Computational experience with minimum spanning tree algorithms

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