zbMATH — the first resource for mathematics

A simpler minimum spanning tree verification algorithm. (English) Zbl 0868.68061
Summary: The problem considered here is that of determining whether a given spanning tree is a minimal spanning tree. In 1984 Komlós presented an algorithm which required only a linear number of comparisons, but nonlinear overhead to determine which comparisons to make. We simplify his algorithm 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.

68W10 Parallel algorithms in computer science
68R10 Graph theory (including graph drawing) in computer science
spanning tree
Full Text: DOI
[1] B. Dixon, M. Rauch, and R. Tarjan, Verification and sensitivity analysis of minimum spanning trees in linear time,SIAM J. Comput.,21(6) (1992), 1184–1192. · Zbl 0760.68032 · doi:10.1137/0221070
[2] D. Harel and R. E. Tarjan, Fast algorithms for finding nearest common ancestors,SIAM J. Comput.,13 (1984), 338–355. · Zbl 0535.68022 · doi:10.1137/0213024
[3] D. Karger, P. N. Klein, and R. E. Tarjan, A randomized linear-time algorithm to find minimum spanning trees,J. Assoc. Comput. Mach.,42 (1995), 321–328. · Zbl 0886.68079
[4] J. Komlós, Linear verification for spanning trees,Combinatorica,5 (1985), 57–65. · Zbl 0579.05031 · doi:10.1007/BF02579443
[5] B. Schieber and U. Vishkin, On finding lowest common ancestors: simplification and parallelization,SIAM J. Comput.,17 (1988), 1253–1262. · Zbl 0669.68049 · doi:10.1137/0217079
[6] R. Tarjan, Applications of path compressions on balanced trees,J. Assoc. Comput. Mach.,26 (1979), 690–715. · Zbl 0413.68063
[7] R. Tarjan,Data Structures and Network Algorithms, CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 44, SIAM, Philadelphia, PA, 1983, p. 73. · Zbl 0584.68077
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.