Abstract
This paper defines a class of tree-like data structures for the UNION-FIND problem. A structure from this class is injectable in another if each tree in the latter one can be obtained as a result of some program in the former as well. By means of injection of structures the nonlinearity in this class is proved.
Preview
Unable to display preview. Download preview PDF.
References
A.V. Aho, J.E. Hopcroft, J.D. Ullman, "The design and analysis of computer algorithms", Addison-Wesley, Reading, MA, 2-nd printing, 1975, 124–139
B.W. Arden, B.A. Galler, R.M. Graham, An algorithm for equivalence declarations, Comm. ACM 4 (7) (1961) 310–344
J.E. Hopcroft, J.D. Ullman, Set merging algorithms, SIAM J. Comput. 2 (1973) 294–303
A. Kirschenbaum, R. van Slyke, Computing minimum spanning trees efficiently, Proc. 25th Annual Conf. of the ACM (1972) 518–527
D.E. Knuth, A. Schönhage, The expected linearity of a simple equivalence algorithm, Theoret. Comput. Sci. 6 (3) (1978) 281–315
M.J. Lao, A new data structure for the UNION-FIND problem, Inform. Processing Lett. 9 (1979) 39–45
R.E. Tarjan, Efficiency of a good but not linear set union algorithm, J. ACM 22 (2) (1975) 215–225
R.E. Tarjan, A class of algorithms which require nonlinear time to maintain disjoint sets, J. Comp. System Sci. 2 (1979) 110–127
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lao, M.J. (1981). A class of tree-like UNION-FIND data structures and the nonlinearity. In: Astesiano, E., Böhm, C. (eds) CAAP '81. CAAP 1981. Lecture Notes in Computer Science, vol 112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10828-9_67
Download citation
DOI: https://doi.org/10.1007/3-540-10828-9_67
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10828-3
Online ISBN: 978-3-540-38716-9
eBook Packages: Springer Book Archive