Computational experience with minimum spanning tree algorithms

DOI10.1016/0167-6377(83)90063-9zbMath0517.90086OpenAlexW1996532959MaRDI QIDQ1053620

D. E. Whited, James P. Jarvis

Publication date: 1983

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0167-6377(83)90063-9

zbMATH Keywords

minimum spanning treecomputational experiencecomparison of algorithmstree algorithms

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Deterministic network models in operations research (90B10)

Related Items (3)

Remarks on the application of genetic algorithm and tabu search method to nonlinear spanning tree problems ⋮ Enhanced second order algorithm applied to the capacitated minimum spanning tree problem ⋮ An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem

Cites Work

• Unnamed Item
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Minimal spanning trees and partial sorting
• On the computational power of pushdown automata
• Computational Methods for Minimum Spanning Tree Algorithms
• Algorithm 613: Minimum Spanning Tree for Moderate Integer Weights
• Finding Minimum Spanning Trees
• A data structure for manipulating priority queues

This page was built for publication: Computational experience with minimum spanning tree algorithms