Abstract
The problem of verifying a given spanning tree to be minimum arises as a subproblem in Karger et al.’s linear-time minimum spanning tree algorithm. Currently two methods exist for the solution of the verification problem in linear time. The latest, proposed by King, is the first direct linear-overhead implementation of Komlós’s algorithm. In the present work, we propose the second linear-time application of the Komlós algorithm which is considerably simpler. It differs from King’s method mainly in the data structure used and the operations defined on it. We eliminate the labelling mechanism and the tags employed in King’s algorithm and construct the look-up tables used in the procedure in shorter time with less storage space.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dixon, B., Rauch, M., and Tarjan, R.E., “Verification and sensitivity analysis of mirnmnfn spanning trees in linear-time”, SIAM J. Comp. 21 (1992) 1184–1192.
Karger, D.R., Klein, RN., and Tarjan, R.E., “A randomized linear-time algorithm to find minimum spanning trees”,J. Assoc. Comput. Machinery 42/2 (1995) 321–328.
King, V., “A simpler minimum spanning tree verification algorithm”, in Selim, G.A., (ed.)Algorithms and Data Structures: proceedings of the 4th International Workshop, Kingston, Canada, Lecture Notes in Computer Science 955, Springer-Verlag (1995) 440–448.
Komlós, J., “Linear verification for spanning trees”,Combinatorica 5 (1985) 57–65.
Schieber, B., and Vishkin, U., “On finding lowest common ancestors: simplification and par allegation”,SIAM J. Comp. 17 (1988) 1253–1262.
Tarjan, R.E., “Applications of path compression on balanced trees”,J. Assoc. Comput. Machinery 26/4 (1979) 690–715.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bazlamaçci, C.F., Hindi, K.S. (1997). Verifying Minimum Spanning Trees in Linear Time. In: Operations Research Proceedings 1996. Operations Research Proceedings, vol 1996. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60744-8_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-60744-8_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62630-5
Online ISBN: 978-3-642-60744-8
eBook Packages: Springer Book Archive