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
Journal ArticleDOI
Novel algorithms for pair and pixel selection and atmospheric error correction in multitemporal InSAR
Jui-Chi Lee,Manoochehr Shirzaei +1 more
TL;DR: In this article , an improved SBAS-type algorithm suitable for processing a large stack of SAR images at an arbitrary resolution is presented, which applies dyadic downsampling combined with widely used Delaunay Triangulation to identify an optimal set of interferometric pairs that minimize systematic errors due to short-lived signals and closure errors.
Journal ArticleDOI
Optimality conditions in preference-based spanning tree problems
TL;DR: The main goal of this paper is to determine which properties of the preference relations are sufficient to assure that the set of 'most-preferred' trees is the setof spanning trees verifying the optimality conditions.
Proceedings ArticleDOI
Parallel implementation of minimum spanning tree algorithms using MPI
Vladimir Lončar,Srdjan Skrbic +1 more
TL;DR: Two algorithms, based on sequential algorithms of Prim and Kruskal, targeting message passing parallel machine with distributed memory are presented, aiming at finding minimum spanning tree of a graph.
Journal ArticleDOI
A splitting algorithm for simulation-based optimization problems with categorical variables
TL;DR: The main motivation is the aim to find—for a vehicle and environment specification—a configuration of the tyres such that the energy losses caused by them are minimized.
A Practical Scalable Shared-Memory Parallel Algorithm for Computing Minimum Spanning Trees
TL;DR: A new simple, elegant and practical algorithm based on Borůvka’s algorithm for parallel MST computation on shared-memory machines is developed that offers good performance even with few processors and therefore can be used as a sole universal implementation.
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.