Computational experience with minimum spanning tree algorithms

Authors:
J. P. Jarvis;D. E. Whited
Affiliations:
Department of Mathematical Sciences, Clemson University, Clemson, SC 29631, U.S.A.;Department of Mathematical Sciences, Clemson University, Clemson, SC 29631, U.S.A.
Venue:
Operations Research Letters
Year:
1983

Citing 4
Cited 1

A data structure for manipulating priority queues

Communications of the ACM
Computing minimum spanning trees efficiently

ACM '72 Proceedings of the ACM annual conference - Volume 1
The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Minimal spanning trees and partial sorting

Operations Research Letters

Enhanced second order algorithm applied to the capacitated minimum spanning tree problem

Computers and Operations Research

Quantified Score

Hi-index	0.00

Visualization

Abstract

The empirical performance of the algorithms of Kruskal, Prim, and Sollin for determining a minimum spanning tree is examined and found to be considerably better than suggested by worst case analysis. Kruskal's algorithm is generally slowest, with the Prim algorithm being preferred for dense networks and the Sollin algorithm for sparse networks. A simple criterion in terms of the number of vertices and edges of a network is given which indicates which of the Prim or Sollin algorithms as implemented is faster for a particular problem.