Abstract

The problem considered here is that of determining whether a given spanning tree is a minimM spanning tree. In 1984, Koml6s presented an Mgorithm which required only a linear number of comparisons, but nonlinear overhead to determine which comparisons to make. We simplify his Mgorithm and give a linear time procedure for its implementation in the unit cost RAM model. The procedure uses table lookup of a few simple functions, which we precompute in time linear in the size of the tree.

Citations

557	Data Structures and Network Algorithms - Tarjan - 1983
285	Fast algorithms for finding nearest common ancestors - Harel, Tarjan - 1984
161	On finding lowest common ancestors: simplification and parallelization - Schieber, Vishkin - 1988
98	A randomized lineartime algorithm to find minimum spanning trees - Karger, Klein, et al. - 1995
78	Applications of path compression on balanced trees - Tarjan - 1979
48	Verification and sensitivity analysis of minimum spanning trees in linear time - Dixon, Rauch, et al. - 1992
21	Linear verification for spanning trees - Komlós - 1985
3	Tarjan, "A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees - Klein, E - 1994
2	Data Structures ad Network Algorithms, volume 44 - Tarjan - 1983
1	Linear verification for spanning trees, Combinato'ica 5 - Kom16s - 1985
1	Applications of path compressions on balanced trees, J.Assoc - Tarjan
1	Linear verification for spanning trees - Komlrs - 1985