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
Hierarchy in industrial structure: The cases of China and the USA
TL;DR: A comparative study of the hierarchy in industrial structures of China and the USA using the World Input–Output Tables (WIOTs), which suggests that a hierarchy of a moderate range might be better for economic growth.
Journal ArticleDOI
Automatic mapping of urban wastewater networks based on manhole cover locations
Nanée Chahinian,Carole Delenne,Carole Delenne,Benjamin Commandré,Benjamin Commandré,Mustapha Derras,Laurent Deruelle,Jean-Stéphane Bailly,Jean-Stéphane Bailly +8 more
TL;DR: The method is tested on the wastewater networks of Prades-le-Lez and Ramnonville Saint Agne, two towns located in Southern France and indicates an overall good agreement between the real and generated networks.
Journal ArticleDOI
Genetic algorithm for spanning tree construction in P2P distributed interactive applications
Yusen Li,Jun Yu,Dapeng Tao +2 more
TL;DR: It is shown that the peer incurred delays are closely related to the topology of the spanning tree topology, and the problem of building spanning tree with minimum total end- to-end delay to receivers in peer-to-peer DIAs is proven to be NP-complete.
Journal ArticleDOI
Application of neutrosophic minimum spanning tree in electrical power distribution network
Xiao Qun Liao,Tong Su,Li Ma +2 more
TL;DR: This paper introduces an algorithmic method based on a genetic algorithm for solving the NMST problem and presents the utility of triangular neutrosophic numbers as edge weights and their application in the electrical distribution network.
Book ChapterDOI
A memetic algorithm for the biobjective minimum spanning tree problem
TL;DR: In this paper, 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 compares the proposed approach with AESSEA, a known algorithm of the literature.
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.