## Verification and Sensitivity Analysis Of Minimum Spanning Trees In Linear Time (1992)

Venue: | SIAM J. Comput |

Citations: | 54 - 2 self |

### BibTeX

@ARTICLE{Dixon92verificationand,

author = {Brandon Dixon and Monika Rauch and Robert and Robert E. Tarjan},

title = {Verification and Sensitivity Analysis Of Minimum Spanning Trees In Linear Time},

journal = {SIAM J. Comput},

year = {1992},

volume = {21},

pages = {1184--1192}

}

### Years of Citing Articles

### OpenURL

### Abstract

. Koml'os has devised a way to use a linear number of binary comparisons to test whether a given spanning tree of a graph with edge costs is a minimum spanning tree. The total computational work required by his method is much larger than linear, however. We describe a linear-time algorithm for verifying a minimum spanning tree. Our algorithm combines the result of Koml'os with a preprocessing and table look-up method for small subproblems and with a previously known almost-linear-time algorithm. Additionally, we present an optimal deterministic algorithm and a linear-time randomized algorithm for sensitivity analysis of minimum spanning trees. 1. Introduction. Suppose we wish to solve some problem for which we know in advance the size of the input data, using an algorithm from some well-defined class of algorithms. For example, consider sorting n numbers, when n is fixed in advance, using a binary comparison tree. Given a sufficient amount of preprocessing time and storage space, we ca...

### Citations

290 | Triangulating a simple polygon in linear time. Discrete Compututational Geometry - Chazelle - 1991 |

187 |
On finding lowest common ancestors: Simplification and parallelization
- Schieber, Vishkin
- 1988
(Show Context)
Citation Context ...uch that every nontree edge joins two related vertices in T . The time to perform this replacement is O(m) using either of the known linear-time algorithms for computing nearest common ancestors [12],=-=[16]-=-. We can now assume that each nontree edge fu; vg is such that vertex u is an ancestor of vertex v. In the second stage, we replace each such edge by a set of up to three edges. In order to determine ... |

160 |
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
- Fredman, Willard
- 1994
(Show Context)
Citation Context ...n , then on a unit-cost random-accessmachine the minimum spanning tree verification and sensitivity analysis problems can be solved deterministically in linear time. More recently Fredman and Willard =-=[6]-=- showed that if the edge costs are single-precision integers, then a minimum spanning a 1 Department of Computer Science, Princeton University, Princeton, New Jersey 08544. 2 Research partially suppor... |

152 |
A linear-time algorithm for a special case of disjoint set union
- Gabow, Tarjan
- 1985
(Show Context)
Citation Context ...concerningminimum spanning trees. This approach was first proposed explicitly by Larmore [15], who used it to solve a convex matrix searching problem. Related techniques were used by Gabow and Tarjan =-=[8]-=- to solve a disjoint set union problem, by Harel and Tarjan [12] to find nearest common ancestors in a tree, and by Fredman [5] to solve the all pairs shortest path problem. We present an algorithm th... |

119 |
The complexity of elementary algebra and geometry
- Ben-Or, Kozen, et al.
- 1986
(Show Context)
Citation Context ...e subproblems. Testing the correctness of such a decision tree amounts to testing the validity of a first-order sentence about the real numbers. Such sentences can be tested in double-exponentialtime =-=[1]-=-, which suffices for the use of the method: we merely reduce the size of the subproblems to double-logarithmic, triple-logarithmic, or further, as needed. As an example, the technique can be applied t... |

91 |
On the History of the Minimum Spanning Tree Problem
- Graham, Hell
- 1985
(Show Context)
Citation Context ...anning tree verification problem are known. There are many efficient algorithms for finding a minimum spanning tree, given only the graph G and the edge costs; see the survey paper by Graham and Hell =-=[10]-=- or the monograph by Tarjan [19, Chapter 6]. The fastest known algorithm for finding a minimum spanning tree is that of Gabow, et al. [7], which runs in O(m log fi(m; n)) time, where fi(m; n) = minfi ... |

89 |
Efficient algorithms for finding minimum spanning trees in undirected and directed graphs
- Gabow, Galil, et al.
- 1986
(Show Context)
Citation Context ...G and the edge costs; see the survey paper by Graham and Hell [10] or the monograph by Tarjan [19, Chapter 6]. The fastest known algorithm for finding a minimum spanning tree is that of Gabow, et al. =-=[7]-=-, which runs in O(m log fi(m; n)) time, where fi(m; n) = minfi j log (i) nsm=ng, and log (i) n is defined recursively by log (0) n = n ; log (i+1) n = log log (i) n. The verification problem was consi... |

89 |
Applications of path compression on balanced trees
- Tarjan
(Show Context)
Citation Context ...med on a unit-cost random-access machine with word size\Omega01/1 n) bits. The verification algorithm uses the comparison bound of Koml'os [14] for the subproblems and Tarjan's O(mff(m; n)) algorithm =-=[17]-=- for the reduced problem. For sensitivity analysis we solve the subproblems using a result of Goddard, King, and Schulman [9] in the randomized case and enumeration of all possible algorithms in the d... |

69 | Data structures and network algorithms . Society for Industrial and Applied Mathematics - Tarjan - 1983 |

65 |
New Bounds on the Complexity of the Shortest Pa th Problem
- Fredman
- 1976
(Show Context)
Citation Context ...trix searching problem. Related techniques were used by Gabow and Tarjan [8] to solve a disjoint set union problem, by Harel and Tarjan [12] to find nearest common ancestors in a tree, and by Fredman =-=[5]-=- to solve the all pairs shortest path problem. We present an algorithm that verifies a minimum spanning tree in an n-vertex, m-edge graph in O(m) time. We also give algorithms performing sensitivity a... |

38 |
A linear time algorithm for finding dominators in flow graphs and related problems
- Harel
- 1985
(Show Context)
Citation Context ...n, addition, and subtraction. In a more powerful model in which bit manipulation of the edge costs is possible, better results can be obtained using table lookup and other ideas. In particular, Harel =-=[11]-=- showed that if the edge costs are integers polynomially bounded in n , then on a unit-cost random-accessmachine the minimum spanning tree verification and sensitivity analysis problems can be solved ... |

25 |
Private communication
- King
- 1999
(Show Context)
Citation Context ...lman [9] have found a randomized algorithm to compute the maxima of n subsets of an ordered universe of size n in O(n) comparisions on the average. Their result, together with the observation of King =-=[13]-=- that their algorithm needs only O(n) random bits on the average, implies the existence of a randomized decision tree of average depth O(m) for the sensitivity analysis problem. Such a decision tree c... |

23 | Linear verification for spanning trees
- Komlos
- 1985
(Show Context)
Citation Context ...r subtracted at unit cost, and side computations to be performed on a unit-cost random-access machine with word size\Omega01/1 n) bits. The verification algorithm uses the comparison bound of Koml'os =-=[14]-=- for the subproblems and Tarjan's O(mff(m; n)) algorithm [17] for the reduced problem. For sensitivity analysis we solve the subproblems using a result of Goddard, King, and Schulman [9] in the random... |

17 | A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs, Algorithmica 11
- Booth, Westbrook
- 1994
(Show Context)
Citation Context ... of G. Tarjan [18] has extended his verification algorithm to an algorithm that solves the sensitivity analysis problem in O(mff(m;n)) time. For the special case of planar graphs, Booth and Westbrook =-=[2]-=- have given an algorithm running in O(m) time. We shall describe a randomized O(m)-time algorithm and a deterministic algorithm that runs in time minimum to within a constant factor, although all that... |

17 | Optimal randomized algorithms for local sorting and set-maxima
- Goddard, King, et al.
- 1990
(Show Context)
Citation Context ...d of Koml'os [14] for the subproblems and Tarjan's O(mff(m; n)) algorithm [17] for the reduced problem. For sensitivity analysis we solve the subproblems using a result of Goddard, King, and Schulman =-=[9]-=- in the randomized case and enumeration of all possible algorithms in the deterministic case. In both cases Tarjan's O(mff(m;n))-time sensitivity analysis algorithm [18] processes the reduced problem.... |

5 |
Fast Algorithms for Finding Nearest
- Harel, Tarjan
- 1984
(Show Context)
Citation Context ...sed explicitly by Larmore [15], who used it to solve a convex matrix searching problem. Related techniques were used by Gabow and Tarjan [8] to solve a disjoint set union problem, by Harel and Tarjan =-=[12]-=- to find nearest common ancestors in a tree, and by Fredman [5] to solve the all pairs shortest path problem. We present an algorithm that verifies a minimum spanning tree in an n-vertex, m-edge graph... |

3 |
Efficient Polygon Triangulation
- Chazelle
- 1990
(Show Context)
Citation Context ... merely reduce the size of the subproblems to double-logarithmic, triple-logarithmic, or further, as needed. As an example, the technique can be applied to the O(n log 3 n)-time algorithm of Chazelle =-=[3]-=- for triangulating a simple n-sided polygon, to produce an algorithm running in time minimum to within a constant factor. The bound for this algorithm is in fact O(n), because of the even more recent ... |

3 |
An optimal algorithm with unknown time complexity for convex matrix searching
- Larmore
- 1990
(Show Context)
Citation Context ...by using a non-optimal algorithm. This paper presents an application of this general technique to two problems concerningminimum spanning trees. This approach was first proposed explicitly by Larmore =-=[15]-=-, who used it to solve a convex matrix searching problem. Related techniques were used by Gabow and Tarjan [8] to solve a disjoint set union problem, by Harel and Tarjan [12] to find nearest common an... |

3 |
Sensitivity Analysis of Minimum Spanning Trees and
- Tarjan
- 1982
(Show Context)
Citation Context ... of Goddard, King, and Schulman [9] in the randomized case and enumeration of all possible algorithms in the deterministic case. In both cases Tarjan's O(mff(m;n))-time sensitivity analysis algorithm =-=[18]-=- processes the reduced problem. We describe the algorithms in Sections 2 and 3. Section 4 contains concluding remarks. It is important to note that our computational model allows only very simple oper... |