Parallel Implementation of Borvka's Minimum Spanning Tree Algorithm
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
An Optimal Minimum Spanning Tree Algorithm
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Approximating the Minimum Spanning Tree Weight in Sublinear Time
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A near-optimal multicast scheme for mobile ad hoc networks using a hybrid genetic algorithm
Expert Systems with Applications: An International Journal
Computing all efficient solutions of the biobjective minimum spanning tree problem
Computers and Operations Research
Minimum spanning tree based one-class classifier
Neurocomputing
Qualitative classification of descent phases in commercial flight data
International Journal of Computational Intelligence Studies
Constructing knowledge in graph theory and combinatorial optimization
WSEAS Transactions on Mathematics
The minimum-area spanning tree problem
Computational Geometry: Theory and Applications
Indexing and retrieval scheme for content-based multimedia applications
TSD'07 Proceedings of the 10th international conference on Text, speech and dialogue
A minimum spanning tree algorithm for efficient P2P video streaming system
ICACT'10 Proceedings of the 12th international conference on Advanced communication technology
Unsupervised host behavior classification from connection patterns
International Journal of Network Management
On symbolic OBDD-based algorithms for the minimum spanning tree problem
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Connection situations under uncertainty and cost monotonic solutions
Computers and Operations Research
The Journal of Supercomputing
The fuzzy weighted k-cardinality tree and its hybrid genetic algorithm
FSKD'06 Proceedings of the Third international conference on Fuzzy Systems and Knowledge Discovery
Sensitivity analysis of minimum spanning trees in sub-inverse-ackermann time
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
The minimum-area spanning tree problem
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Weighted bagging for graph based one-class classifiers
MCS'10 Proceedings of the 9th international conference on Multiple Classifier Systems
A memetic algorithm for the biobjective minimum spanning tree problem
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Graph based k-means clustering
Signal Processing
Standard cell routing via boolean satisfiability
Proceedings of the 49th Annual Design Automation Conference
Research paper: The saga of minimum spanning trees
Computer Science Review
On symbolic OBDD-based algorithms for the minimum spanning tree problem
Theoretical Computer Science
kNN-Borůvka-GPU: a fast and scalable MST construction from kNN graphs on GPU
ICCSA'12 Proceedings of the 12th international conference on Computational Science and Its Applications - Volume Part I
Fast topology estimation for image mosaicing using adaptive information thresholding
Robotics and Autonomous Systems
| Hi-index | 0.00 |
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.