Minimal spanning trees and partial sorting

Authors:
J. J. Brennan
Affiliations:
Department of Management, College of Business Administration, The University of Texas at Austin, Austin, TX 78712, U.S.A.
Venue:
Operations Research Letters
Year:
1982

Citing 2
Cited 1

Algorithms + Data Structures = Programs

Algorithms + Data Structures = Programs
Computing minimum spanning trees efficiently

ACM '72 Proceedings of the ACM annual conference - Volume 1

Computational experience with minimum spanning tree algorithms

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Two partial sorting algorithms used in conjunction with Kruskal's algorithm to find minimal spanning trees, are tested. The superior method can be used in the computation of the Held-Karp bound for the traveling salesman problem and other sort-based greedy algorithms.