On the History of the Minimum Spanning Tree Problem

  title={On the History of the Minimum Spanning Tree Problem},
  author={Ronald L. Graham and Pavol Hell},
  journal={Annals of the History of Computing},
  • R. GrahamP. Hell
  • Published 1985
  • Computer Science
  • Annals of the History of Computing
It is standard practice among authors discussing the minimum spanning tree problem to refer to the work of Kruskal(1956) and Prim (1957) as the sources of the problem and its first efficient solutions, despite the citation by both of Boruvka (1926) as a predecessor. In fact, there are several apparently independent sources and algorithmic solutions of the problem. They have appeared in Czechoslovakia, France, and Poland, going back to the beginning of this century. We shall explore and compare… 

Figures from this paper

The saga of minimum spanning trees

Minimum spanning trees

A variant of Borůvka’s algorithm that developed during the graph theory course work of undergraduate students is presented, the proof of the algorithm is discussed, it is compared to existing algorithms, and an implementation of the procedure in Maple is presented.

The Minimum Spanning Tree Problem: Jarník's solution in historical and present context

  • E. Milková
  • Computer Science
    Electron. Notes Discret. Math.
  • 2007

uvka on minimum spanning tree problem Translation of both the 1926 papers, comments, history

The /rst English translation of Bor � uvka's algorithm is the basis of the Minimum Spanning Tree Problem (MST) and the survey of development related to the MST problem and by remarks and historical perspective.

Minimum Spanning Trees

Two classical algorithms are discussed: Prim's algorithm and Kruskal's algorithm, followed by recent developments that improve the asymptotic time bounds using advanced data structures.

How to Find a Minimum Spanning Tree in Practice

The factors that influence the actual running time of an algorithm are reviewed, from choice of language, machine, and compiler, through low-level implementation choices, to purely algorithmic issues.

Greedy Algorithms for Minimum Spanning Tree

A spanning tree for a connected graph with non-negative weights on its edges, and one problem: a max weight spanning tree, where the greedy algorithm results in a solution.

Minimum-weight spanning tree algorithms A survey and empirical study




On Finding and Updating Spanning Trees and Shortest Paths

The most notable result is that a spanning tree solution can be updated in $O(n)$ when a new node is added to an n-node graph whose minimum spanning tree is known.

Finding Minimum Spanning Trees

This paper studies methods for finding minimum spanning trees in graphs and results include relationships with other problems which might lead general lower bound for the complexity of the minimum spanning tree problem.

Algorithms for Updating Minimal Spanning Trees

Finding Minimum Spanning Trees with a Fixed Number of Links at a Node

This paper addresses a variant of the minimum spanning tree problem in which a given node is required to have a fixed number of incident edges and shows that this problem can be solved by a highly efficient “quasi-greedy” algorithm.

On the shortest spanning subtree of a graph and the traveling salesman problem

7. A. Kurosh, Ringtheoretische Probleme die mit dem Burnsideschen Problem uber periodische Gruppen in Zussammenhang stehen, Bull. Acad. Sei. URSS, Ser. Math. vol. 5 (1941) pp. 233-240. 8. J.

Computing minimum spanning trees efficiently

Modifications to both Prim's and Kruskal's Algorithms are introduced which give significant improvements for the complete range of sparseness, and a dramatic reduction in execution time can be obtained for sparse networks when the network under consideration is sparse.

Two Algorithms for Generating Weighted Spanning Trees in Order

  • H. Gabow
  • Computer Science
    SIAM J. Comput.
  • 1977
Two algorithms for generating spanning trees of a connected graph in order of increasing weight are presented. The first generates the K smallest weight trees, where K can be specified in advance or

Applications of Path Compression on Balanced Trees

A method for computing functions defined on paths in trees based on tree manipulation techniques first used for efficiently representing equivalence relations, which has an almost-linear running time and is useful for solving certain kinds of pathfinding problems on reducible graphs.

Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem

A highly efficient algorithm (HK) devised by Held and Karp for solving the symmetric traveling-salesman problem was presented at the 7th Mathematical Programming Symposium in 1970 and published in