The cell probe complexity of dynamic data structures
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Faster scaling algorithms for general graph matching problems
Journal of the ACM (JACM)
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
A randomized linear-time algorithm to find minimum spanning trees
Journal of the ACM (JACM)
Lower bounds for the union-find and the split-find problem on pointer machines
Journal of Computer and System Sciences
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
Undirected single-source shortest paths with positive integer weights in linear time
Journal of the ACM (JACM)
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
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)
An optimal minimum spanning tree algorithm
Journal of the ACM (JACM)
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
Improved Shortest Paths on the Word RAM
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
On the Comparison-Addition Complexity of All-Pairs Shortest Paths
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
LATIN '00 Proceedings of the 4th Latin American Symposium on Theoretical Informatics
Scaling and related techniques for geometry problems
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
A new approach to all-pairs shortest paths on real-weighted graphs
Theoretical Computer Science - Special issue on automata, languages and programming
On the shortest path and minimum spanning tree problems
On the shortest path and minimum spanning tree problems
A Shortest Path Algorithm for Real-Weighted Undirected Graphs
SIAM Journal on Computing
A scaling algorithm for weighted matching on general graphs
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
On the History of the Minimum Spanning Tree Problem
IEEE Annals of the History of Computing
Randomized minimum spanning tree algorithms using exponentially fewer random bits
ACM Transactions on Algorithms (TALG)
Dual-failure distance and connectivity oracles
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Finding best swap edges minimizing the routing cost of a spanning tree
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
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
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
Linear-Time Approximation for Maximum Weight Matching
Journal of the ACM (JACM)
| Hi-index | 0.00 |
We present a deterministic algorithm for computing the sensitivity of a minimum spanning tree or shortest path tree in O(m log α(m,n)) time, where α is the inverse-Ackermann function. This improves upon a long standing bound of O(mα(m,n)) established by Tarjan. Our algorithms are based on an efficient split-findmin data structure, which maintains a collection of sequences of weighted elements that may be split into smaller subsequences. As far as we are aware, our split-findmin algorithm is the first with superlinear but sub-inverse-Ackermann complexity.