Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
An optimal algorithm with unknown time complexity for convex matrix searching
Information Processing Letters
Verification and sensitivity analysis of minimum spanning trees in linear time
SIAM Journal on Computing
Optimal randomized algorithms for local sorting and set-maxima
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)
Computability and complexity: from a programming perspective
Computability and complexity: from a programming perspective
Linear-time pointer-machine algorithms for least common ancestors, MST verification, and dominators
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Applications of Path Compression on Balanced Trees
Journal of the ACM (JACM)
The soft heap: an approximate priority queue with optimal error rate
Journal of the ACM (JACM)
A minimum spanning tree algorithm with inverse-Ackermann type complexity
Journal of the ACM (JACM)
Concurrent threads and optimal parallel minimum spanning trees 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
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
A Faster Deterministic Algorithm for Minimum Spanning Trees
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Finding Minimum Spanning Trees in O(m alpha(m,n)) Time
Finding Minimum Spanning Trees in O(m alpha(m,n)) Time
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
TAN Classifiers Based on Decomposable Distributions
Machine Learning
Distributed verification of minimum spanning trees
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
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
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)
Cost-effective multicast approaches for time-critical applications in dynamic network environments
Journal of High Speed Networks
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
A simpler implementation and analysis of Chazelle's soft heaps
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Journal of Network and Computer Applications
Minimum spanning tree based one-class classifier
Neurocomputing
Combinatorial optimization in system configuration design
Automation and Remote Control
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
Mobile Web 2.0-Oriented Five Senses Multimedia Technology with LBS-Based Intelligent Agent
UIC '09 Proceedings of the 6th International Conference on Ubiquitous Intelligence and Computing
WiBro Net.-Based Five Senses Multimedia Technology Using Mobile Mash-Up
ICCSA '09 Proceedings of the International Conference on Computational Science and Its Applications: Part II
CTL model update for system modifications
Journal of Artificial Intelligence Research
Expert Systems with Applications: An International Journal
Fast user notification in large-scale digital libraries: experiments and results
ADBIS'07 Proceedings of the 11th East European conference on Advances in databases and information systems
Fast euclidean minimum spanning tree: algorithm, analysis, and applications
Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining
Algorithms and theory of computation handbook
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
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
On the existence of truthful mechanisms for the minimum-cost approximate shortest-paths tree problem
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Sensitivity analysis of minimum spanning trees in sub-inverse-ackermann time
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Efficient truthful mechanisms for the single-source shortest paths tree problem
Euro-Par'05 Proceedings of the 11th international Euro-Par conference on Parallel Processing
Stability of networks in stretchable graphs
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Efficient determination of the k most vital edges for the minimum spanning tree problem
Computers and Operations Research
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
The MST of Symmetric Disk Graphs (in Arbitrary Metric Spaces) is Light
SIAM Journal on Discrete Mathematics
| Hi-index | 0.01 |
We establish that the algorithmic complexity of the minimumspanning tree problem is equal to its decision-tree complexity.Specifically, we present a deterministic algorithm to find aminimum spanning tree of a graph with n vertices andm edges that runs in timeO(T*(m,n)) whereT* is the minimum number of edge-weightcomparisons needed to determine the solution. The algorithm isquite simple and can be implemented on a pointer machine.Althoughour time bound is optimal, the exact function describing it is notknown at present. The current best bounds known forT* are T*(m,n) =Ω(m) and T*(m,n) =O(m ∙ α(m,n)), where α is acertain natural inverse of Ackermann's function.Even under theassumption that T* is superlinear, we show thatif the input graph is selected from Gn,m,our algorithm runs in linear time with high probability, regardlessof n, m, or the permutation of edge weights. Theanalysis uses a new martingale for Gn,msimilar to the edge-exposure martingale forGn,p.