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
Alleviating Class-Wise Gradient Imbalance for Pulmonary Airway Segmentation
TL;DR: In this article, a General Union loss function was proposed to avoid the impact of airway size by distance-based weights and adaptively tune the gradient ratio based on the learning process.
Journal ArticleDOI
Clustering Techniques for Secondary Substations Siting
TL;DR: K-means algorithm, hierarchical agglomerative clustering, and a method based on optimal weighted tree partitioning are adapted to the problem and run on two real case studies, with different population densities.
Journal ArticleDOI
ShuTu: Open-Source Software for Efficient and Accurate Reconstruction of Dendritic Morphology
TL;DR: ShuTu is a new software package that facilitates accurate and efficient reconstruction of dendrites imaged using bright-field microscopy and allows neurons with complex dendritic morphologies to be reconstructed rapidly and efficiently, thus facilitating the use of computer models to study dendrite structure-function relationships and the computations performed by single neurons.
Journal ArticleDOI
Spanning tree trajectory optimization in the galaxy space
TL;DR: A layout-first topology-second approach that allows an efficient settlement tree search guided by the pre-specified ideal spatial distribution is presented and the possibility that a greedy search can generate even better settlement trees, based on the same initial conditions, when compared to that of the winning solution.
Proceedings ArticleDOI
Clustering Motion for Real-Time Optical Flow Based Tracking
TL;DR: This paper proposes an interest point selection method that takes into account the motion of previously tracked points in order to constrain the number of point trajectories needed, and achieves a very efficient clustering.
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.