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
Reviews of Books and Teaching Materials
TL;DR: Nick Fieller’s Basics of Matrix Algebra for Statistics with R is a well-written book and organized well for readers of an introductory book on linear algebra, but falls short in certain areas.
Journal ArticleDOI
A network analysis of shariah-compliant stocks across global financial crisis: a case of Malaysia
TL;DR: In this paper, the authors investigated the topological structure of 125 shariah-compliant stocks traded in Bursa Malaysia from the year 2000 until 2017 using minimum spanning tree (MST) technique.
Proceedings Article
FSMEC: a feature selection method based on the minimum spanning tree and evolutionary computation
TL;DR: A new type of supervised and multivariate feature selection approach that works by constructing proximity graphs in such a way that the number of edges connecting samples from different classes is minimised is presented.
Proceedings ArticleDOI
Determining minimum spanning tree in an undirected weighted graph
Shikha Rai,Swati Sharma +1 more
TL;DR: This new algorithm is named as RAY, as it gives a new ray of hope in the field of graphs that can be used as a better option for finding the minimum spanning tree of any undirected weighted graph with less duration of time as well as with an easy approach.
Journal ArticleDOI
Invasion percolation through minimum-weight spanning trees
Roland Glantz,Markus Hilpert +1 more
TL;DR: The property of minimum-weight spanning trees is formulated that justifies the two-step approach to invasion bond percolation and is extended to simulations of drainage (imbibition) that include trapping of the wetting (nonwetting) phase.
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.