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
Dissertation

Model-based covariable decorrelation in linear regression (CorReg). Application to missing data and to steel industry

TL;DR: This thesis was motivated by correlation issues in real datasets, in particular industrial datasets, and stands in explicit modeling of the correlations between covariates by a structure of sub-regressions, that simply is a system of linear regressions between the covariates.
Journal ArticleDOI

Close-Proximity Analysis: Another Variation on the Minimum-Spanning-Tree Problem

Per Hage, +1 more
- 01 Aug 1995 - 
TL;DR: In this article, the problem of finding a minimum spanning tree with minimum value sum is considered. But the problem is not restricted to trees, it is also applicable to graphs, as shown in Figure 1.

The upper talocalcanean join

TL;DR: In order to build protheses that simulate the motion of the UTJ, the geometry of the two surfaces FAIT and FAST, respectively are studied, using line geometric methods to best approximating linear line complexes and compute the axis of the thus determined helical motion.
Dissertation

Graph-based segmentation and scene understanding for context-free point clouds

Sandro Spina
TL;DR: The overall results demonstrate that the context-agnostic methods presented in this work can be successfully employed to manage the complexity of ever growing repositories.
Journal ArticleDOI

Overview of network-based methods for analyzing financial markets

Pavel Tsankov
TL;DR: This study reviews literature discussing the time evolution of the observed phenomena from a network perspective, as well as applications in economy and finance, ranging from risk and diversification, through policy making and better understanding crisis impact, to forecasting.
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.