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
Optimal geometry of transportation networks.
TL;DR: In this article, the authors consider a distribution of points in the plane and ask for the network $G$ of given length $L$ that is optimal in a certain sense.
Journal ArticleDOI
fMRI classification method with multiple feature fusion based on minimum spanning tree analysis
TL;DR: This work proposes a novel method combining brain region and subgraph features for classification, utilizing two feature types to quantify two properties of the network, and demonstrates that different forms of feature representation provide complementary information.
Journal Article
A memetic algorithm for the biobjective minimum spanning tree problem
TL;DR: In this article, a memetic algorithm is presented to solve the bi-objective minimum spanning tree problem, which is a NP-hard problem with applications in network design, and a computational experiment is performed with AESSEA, a known algorithm of the literature.
Journal ArticleDOI
Modeling complexity in engineered infrastructure system: Water distribution network as an example.
Fang Zeng,Xiang Li,Ke Li +2 more
TL;DR: To model the growth of water distribution networks, a complex network model was developed following the combination of local optimization rules and engineering considerations and can generate a water distribution network similar to reported real-world WDNs on some structural properties.
Journal ArticleDOI
Phase-selection algorithms to minimize cost and imbalance in U.S. synthetic distribution systems
Fernando Postigo,Carlos Mateo,Tomás Gómez,Fernando de Cuadra,Pablo Duenas,Tarek Elgindy,Bri-Mathias Hodge,Bryan Palmintier,Venkat Krishnan +8 more
TL;DR: A Reference Network Model (RNM) aimed to plan large-scale, U.S-style, synthetic distribution systems is presented, with special emphasis on two algorithms that allow multi-phase feeder design.
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.