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
Proceedings ArticleDOI

Systematic State Equation Derivation for Linear Systems Using the Normal Tree Method

TL;DR: A systematic method to derive the state equations of a linear system starting from its linear graph is proposed, and the normal tree is used in the analysis, which is a method to determine the dependencies between energy storage elements in the system.
Journal ArticleDOI

Application of minimal spanning trees in glioma grading--a CLIPPER program for the calculation and construction of minimal spanning trees.

TL;DR: A CLIPPER program for the calculation and graphical representation of minimal spanning trees (MST) is presented and the applicability of MST is discussed by an example from the field of astrocytoma grading.

Routing Map Topology Analysis and Application

Lei Zhu
TL;DR: This document summarizes current capabilities, research and operational priorities, and plans for further studies that were established at the 2015 USGS workshop on quantitative hazard assessments of earthquake-triggered landsliding and liquefaction in the Central American region.

Se-3d: a controlled comparative usability study of a virtual reality semantic hierarchy explorer

TL;DR: It is suggested it is possible to extract additional value from organized collections by offering untrained users a reconstructed subject structure integrated with keyword searching, and this research is significant for the development and testing of improved bridges between information organization and IR, and interactive information visualization.
Proceedings ArticleDOI

A Parallel Algorithm for Minimum Spanning Tree on GPU

TL;DR: This paper proposes a parallel MST algorithm and implements it on a GPU and proves that the algorithm is correct and it finds the MST after O(log p) iterations (communication and computation rounds), and has a good performance onreal parallel machines.
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.