Data structures and network algorithms
Data structures and network algorithms
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Verification and sensitivity analysis of minimum spanning trees in linear time
SIAM Journal on Computing
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
Davenport-Schinzel sequences and their geometric applications
Davenport-Schinzel sequences and their geometric applications
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
The soft heap: an approximate priority queue with optimal error rate
Journal of the ACM (JACM)
The soft heap: an approximate priority queue with optimal error rate
Journal of the ACM (JACM)
Concurrent threads and optimal parallel minimum spanning trees algorithm
Journal of the ACM (JACM)
An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
Computing shortest paths with comparisons and additions
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
On AC0 implementations of fusion trees and atomic heaps
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximating the Minimum Spanning Tree Weight in Sublinear Time
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Optimal Terrain Construction Problems and Applications in Intensity-Modulated Radiation Therapy
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Combinatorial power in multimedia processors
ACM SIGARCH Computer Architecture News
Meldable RAM priority queues and minimum directed spanning trees
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Covering minimum spanning trees of random subgraphs
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
Estimating the weight of metric minimum spanning trees in sublinear-time
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Greedy optimal homotopy and homology generators
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Efficient Parallel Hierarchical Clustering Algorithms
IEEE Transactions on Parallel and Distributed Systems
A minimum interference routing algorithm with reduced computational complexity
Computer Networks: The International Journal of Computer and Telecommunications Networking
On an Online Spanning Tree Problem in Randomly Weighted Graphs
Combinatorics, Probability and Computing
ACM Transactions on Algorithms (TALG)
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
Optimal per-edge processing times in the semi-streaming model
Information Processing Letters
Randomized minimum spanning tree algorithms using exponentially fewer random bits
ACM Transactions on Algorithms (TALG)
Testing Euclidean minimum spanning trees in the plane
ACM Transactions on Algorithms (TALG)
Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
The Pk Partition Problem and Related Problems in Bipartite Graphs
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Linear-time algorithms for geometric graphs with sublinearly many crossings
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
A simpler implementation and analysis of Chazelle's soft heaps
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Minimum spanning tree based one-class classifier
Neurocomputing
Incremental Network Optimization: Theory and Algorithms
Operations Research
Fast minimum spanning tree for large graphs on the GPU
Proceedings of the Conference on High Performance Graphics 2009
Design and Engineering of External Memory Traversal Algorithms for General Graphs
Algorithmics of Large and Complex Networks
On Cartesian Trees and Range Minimum Queries
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Approximation Algorithms for a Network Design Problem
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Collapses and Watersheds in Pseudomanifolds
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
On watershed cuts and thinnings
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Fast reoptimization for the minimum spanning tree problem
Journal of Discrete Algorithms
biRNA: fast RNA-RNA binding sites prediction
WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
A generic algorithm for approximately solving stochastic graph optimization problems
SAGA'09 Proceedings of the 5th international conference on Stochastic algorithms: foundations and applications
Some links between extremum spanning forests, watersheds and min-cuts
Image and Vision Computing
Fast euclidean minimum spanning tree: algorithm, analysis, and applications
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Maximum normalized spacing for efficient visual clustering
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge 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
Ectropy of diversity measures for populations in Euclidean space
Information Sciences: an International Journal
Filtering: a method for solving graph problems in MapReduce
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Efficient code compression for embedded processors
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
A RankMOEA to approximate the pareto front of a dynamic principal-agent model
Proceedings of the 13th annual conference on Genetic and evolutionary computation
Surface reconstruction using power watershed
ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing
Efficient algorithms for finding the k most vital edges for the minimum spanning tree problem
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
The MST of symmetric disk graphs (in arbitrary metric spaces) is light
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Efficiently approximating Markov tree bagging for high-dimensional density estimation
ECML PKDD'11 Proceedings of the 2011 European conference on Machine learning and knowledge discovery in databases - Volume Part III
Faster algorithm for optimum Steiner trees
Information Processing Letters
Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Edge Crossings
SIAM Journal on Computing
A truthful (2 - 2/k)-approximation mechanism for the steiner tree problem with k terminals*
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Sensitivity analysis of minimum spanning trees in sub-inverse-ackermann time
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Coordination of multi-link spectrum handoff in multi-radio multi-hop cognitive networks
Journal of Parallel and Distributed Computing
The Journal of Machine Learning Research
Efficient determination of the k most vital edges for the minimum spanning tree problem
Computers and Operations Research
On the probabilistic min spanning tree Problem
Journal of Mathematical Modelling and Algorithms
The path partition problem and related problems in bipartite graphs
Operations Research Letters
Research paper: The saga of minimum spanning trees
Computer Science Review
Improved algorithms for replacement paths problems in restricted graphs
Operations Research Letters
On symbolic OBDD-based algorithms for the minimum spanning tree problem
Theoretical Computer Science
The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light
SIAM Journal on Discrete Mathematics
Monocular rear-view obstacle detection using residual flow
ECCV'12 Proceedings of the 12th international conference on Computer Vision - Volume 2
Fast and memory-efficient minimum spanning tree on the GPU
International Journal of Computational Science and Engineering
Robust estimation of location and scatter by pruning the minimum spanning tree
Journal of Multivariate Analysis
Random spanning trees and the prediction ofweighted graphs
The Journal of Machine Learning Research
| Hi-index | 0.01 |
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is 0(m &agr;(m, n)), where &agr; is the classical functional inverse of Ackermann's function and n (respectively, m) is the number of vertices (respectively, edges). The algorithm is comparison-based : it uses pointers, not arrays, and it makes no numeric assumptions on the edge costs.