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
Book ChapterDOI
Mapping the Curricular Structure and Contents of Network Science Courses
TL;DR: The results illustrate the current state of consensus formation (including variations and disagreements) among the network science community on what should be taught about networks and how, which may also be informative for K–12 education and informal education.
Journal ArticleDOI
Data completion in building information management: electrical lines from range scans and photographs
TL;DR: A data completion technique based on knowledge management that represents norms and standards in a machine-readable manner is presented and is a necessary step to take full advantage of building information modeling.
Journal ArticleDOI
The reduction of computation times of upper and lower tolerances for selected combinatorial optimization problems
TL;DR: This paper summarizes efficient computational methods for computing tolerances for combinatorial optimization problems for which the computation of all tolerances and an optimal solution have almost the same computational complexity as of finding a optimal solution only.
DissertationDOI
Exact algorithms for the Steiner Tree Problem
TL;DR: This thesis improves the running time of algorithm to O(2.684k) by showing that the optimum Steiner tree T can be partitioned into T = T1 [ T2 [ T3 in a certain way such that each Ti is a minimum Steiners tree in a suitable contracted graph Gi with less than k 2 terminals.
Journal ArticleDOI
Sequence and structure space model of protein divergence driven by point mutations.
TL;DR: A stochastic model of evolution is introduced that involves residue substitutions as the sole source of structure innovation, and is nonetheless able to reproduce the diversity of the protein domains repertoire, its cluster structure with heavy-tailed distribution of family sizes, and presence of the twilight zone populated with remote homologs.
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.