Journal ArticleDOI
On the History of the Minimum Spanning Tree Problem
Ron Graham,Pavol Hell +1 more
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
BookDOI
Intelligent Data Mining in Law Enforcement Analytics: New Neural Networks Applied to Real Problems
TL;DR: Individuals with a background in Artificial Intelligence will find the opening chapters to be an excellent refresher but the greatest excitement will likely be the law enforcement examples, for little has been done in that area.
BookDOI
The Power of Algorithms: Inspiration and Examples in Everyday Life
TL;DR: This book is an excellent introduction to an intriguing domain and it will be enjoyed by undergraduate and postgraduate students in computer science, engineering, and mathematics, and more broadly by all those engaged with algorithmic thinking.
Journal ArticleDOI
Three-dimensional gravity inversion using graph theory to delineate the skeleton of homogeneous sources
TL;DR: In this article, a genetic algorithm with elitism was used to generate a set of possible solutions to solve the minimum spanning tree (MST) problem, and each estimate was associated to a graph to produce unique and stable estimates, and the position of the point masses by minimizing the statistical variance of the distances of an MST jointly with the data-misfit function during the iterations of the genetic algorithm.
Journal ArticleDOI
An Improved Algorithm for the Constrained Bottleneck Spanning Tree Problem
Abraham P. Punnen,K. P. K. Nair +1 more
TL;DR: This work proposes an algorithm to solve the bottleneck spanning tree problem with an additional linear constraint and has an improved worst case performance over the best known algorithm for this problem.
Journal ArticleDOI
Hierarchies in communities of Borsa Istanbul Stock Exchange
TL;DR: This paper introduces a method to build a connected graph representation of Borsa Istanbul based on the spectrum and detects graph communities and internal hierarchies by using the minimum spanning trees.
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
Robert R. Sokal,P.H.A. Sneath +1 more
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.