A Simpler Minimum Spanning Tree Verification Algorithm

Algorithmica (New York)

Volumn 18, Issue 2, 1997, Pages 263-270

  King, V ^a  

^a UNIVERSITY OF VICTORIA   (Canada)

Author keywords

Minimum spanning tree; Verification

Indexed keywords

EID: 0000626504     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/BF02526037     Document Type: Article

References (7)

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.
2. D. Harel and R. E. Tarjan, Fast algorithms for finding nearest common ancestors, SIAM J. Comput., 13 (1984), 338-355.
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.
4. J. Komlós, Linear verification for spanning trees, Combinatorica, 5 (1985), 57-65.
5. B. Schieber and U. Vishkin, On finding lowest common ancestors: simplification and parallelization, SIAM J. Comput., 17 (1988), 1253-1262.
6. R. Tarjan, Applications of path compressions on balanced trees, J. Assoc. Comput. Mach., 26 (1979), 690-715.
7. R. Tarjan, Data Structures and Network Algorithms, CBMS-NSF Regional Conference Series in Applied Mathematics, Vol. 44, SIAM, Philadelphia, PA, 1983, p. 73.