A simpler minimum spanning tree verification algorithm
- V. King
- … show all 1 hide
Purchase on Springer.com
$39.95 / €34.95 / £29.95*
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.
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.
- 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. CrossRef
- D. Harel and R. E. Tarjan, Fast algorithms for finding nearest common ancestors,SIAM J. Comput.,13 (1984), 338–355. CrossRef
- 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.
- J. Komlós, Linear verification for spanning trees,Combinatorica,5 (1985), 57–65.
- B. Schieber and U. Vishkin, On finding lowest common ancestors: simplification and parallelization,SIAM J. Comput.,17 (1988), 1253–1262. CrossRef
- R. Tarjan, Applications of path compressions on balanced trees,J. Assoc. Comput. Mach.,26 (1979), 690–715.
- R. Tarjan,Data Structures and Network Algorithms, CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 44, SIAM, Philadelphia, PA, 1983, p. 73.
- A simpler minimum spanning tree verification algorithm
Volume 18, Issue 2 , pp 263-270
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Minimum spanning tree
- Industry Sectors
- V. King (1)
- Author Affiliations
- 1. Department of Computer Science, University of Victoria, V8W 3P6, Victoria, British Columbia, Canada