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
Book ChapterDOI

ProLoD: An Efficient Framework for Processing Logistics Data

TL;DR: A framework called ProLoD which performs pre-processing and processing tasks with different types of data, which relies on machine learning algorithms, for processing data, and is evaluated by comparing its performance with the HCL algorithm found in the widely-adopted machine learning tool called WEKA.
Journal Article

Multi-Agent Grouping Algorithm in Wireless Sensor Networks

TL;DR: A novel approach was proposed based on hop-oriented minimum spanning tree that achieves flexible trade-off control between energy cost and task duration by dynamically selecting edge weights in the total connected graph.
Dissertation

Use of semantic, syntactic and sentiment features to automate essay evaluation

TL;DR: The proposed system incorporates not just the rule-based grammar and surface level coherence check but also includes the semantic similarity of the sentences, which is proposed to use graph-based relationships within the essay’s content and polarity of opinion expressions.
Proceedings ArticleDOI

Reliable Agglomerative Clustering

TL;DR: In this paper, the authors proposed to extract all the reliable linkages at each step, instead of the smallest one, to provide adaptive, density-consistent and flexible solutions.

Comparative Analysis for The Multi Period Degree Minimum Spanning Tree Problem

TL;DR: WADR1 and WADR2 algorithms are improved by setting the number of elements in the set of vertices that must be in installed in a certain period as a fix number and adding the length of the path in DFS.
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.