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
Proceedings ArticleDOI
Particle Swarm Optimization for the Bi-objective Degree constrained Minimum Spanning Tree
TL;DR: A particle swarm optimization algorithm for the multi-criteria degree constrained minimum spanning tree problem is presented, based upon local search and path-relinking procedures.
Dissertation
Hierarchical Real-Time Recognition of Compound Objects in Images
TL;DR: This dissertation proposes a novel approach for the recognition of compound 2D objects in images under real-time conditions that is general with regard to the type of object, it shows a very high robustness, and the compound object is localized with high accuracy even under projective distortions.
Dissertation
Algorithms for Geometric Covering and Piercing Problems
TL;DR: This thesis involves the study of a range of geometric covering and piercing problems, where the unifying thread is approximation using disks, and outlines approximation algorithms for the general DUDC problem which make use of the algorithms for LSDUDC and WSDUDC.
Journal ArticleDOI
An exploratory method for detecting multi-level clumps in the distribution of points - a computational tool, VCM (variable clumping method)
Atsuyuki Okabe,Shino Funamoto +1 more
TL;DR: An explanatory tool (a FORTRAN program linked to GIS software), called VCM (Variable Clumping Method), for detecting statistically significant `multi-level clumps' in the distribution of points.
Journal ArticleDOI
On Minimum Spanning Trees and Determinants
TL;DR: In this paper, the authors present an algorithm that uses Kirchhoff's determinants to generate the set of all minimum spanning trees in a weighted graph, which is perhaps the most famous of all such algorithms.
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.