scispace - formally typeset
Journal ArticleDOI

On the History of the Minimum Spanning Tree Problem

Ron Graham, +1 more
- 01 Jan 1985 - 
- Vol. 7, Iss: 1, pp 43-57
TLDR
There are several apparently independent sources and algorithmic solutions of the minimum spanning tree problem and their motivations, and they have appeared in Czechoslovakia, France, and Poland, going back to the beginning of this century.
Abstract
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 these works and their motivations, and relate them to the most recent advances on the minimum spanning tree problem.

read more

Citations
More filters
Journal IssueDOI

Critical random graphs and the structure of a minimum spanning tree

TL;DR: In this article, the authors considered the complete graph on n vertices whose edges are weighted by independent and identically distributed edge weights and showed that if the random weights are all distinct, then the expected diameter of such a tree is Θ(n 1-3).
Journal ArticleDOI

Use of the minimum spanning tree model for molecular epidemiological investigation of a nosocomial outbreak of hepatitis C virus infection.

TL;DR: The MST model, supported by an exhaustive clinical-epidemiological investigation, appears to be a useful tool in tracing the history of transmission in outbreaks of HCV infection.
Journal ArticleDOI

Fast heuristic algorithms for rectilinear steiner trees

TL;DR: An early algorithm by Hanan is shown to have anO(n logn) time implementation using computational geometry techniques, and an extensive review of proposed heuristics is given.
Journal ArticleDOI

Graph Theoretic Analysis of Resting State Functional MR Imaging

TL;DR: The theoretic and practical frontiers of resting state functional MR imaging are highlighted with observations about major avenues for conceptual advances and clinical translation.
Proceedings ArticleDOI

Using certification trails to achieve software fault tolerance

TL;DR: A technique for achieving fault tolerance in hardware and software systems is introduced that uses time and software redundancy for software fault tolerance and can be outlined as follows.
References
More filters
Journal ArticleDOI

A note on two problems in connexion with graphs

TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Journal ArticleDOI

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

TL;DR: Kurosh and Levitzki as discussed by the authors, on the radical of a general ring and three problems concerning nil rings, Bull Amer Math Soc vol 49 (1943) pp 913-919 10 -, On the structure of algebraic algebras and related rings.
Journal ArticleDOI

Hierarchical clustering schemes

TL;DR: A useful correspondence is developed between any hierarchical system of such clusters, and a particular type of distance measure, that gives rise to two methods of clustering that are computationally rapid and invariant under monotonic transformations of the data.
Journal ArticleDOI

Shortest connection networks and some generalizations

TL;DR: In this paper, the basic problem of interconnecting a given set of terminals with a shortest possible network of direct links is considered, and a set of simple and practical procedures are given for solving this problem both graphically and computationally.
Book

Principles of numerical taxonomy

TL;DR: The authors continued the story of psychology with added research and enhanced content from the most dynamic areas of the field, such as cognition, gender and diversity studies, neuroscience and more, while at the same time using the most effective teaching approaches and learning tools.