Abstract
An extension of the well known Set-Union problem is considered, where searching in the history of the partition and backtracking over the Union operations are possible. A partially persistent data structure is presented which maintains a partitions of an n-item set and performs each Union, each Find and each search in the past in O(lg n) time per operation, at the same time allowing to backtrack, over the sequence of Unions in costant time. The space complexity of such a structure is O(n).
This is a preview of subscription content, log in via an institution to check access.
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 (1974).
N. Blum, “On the Single Operation Worst Case Time Complexity of the Disjoint Set-Union Problem”, Proc. 2nd Symp. on Theretical Aspects of Computer Science (1985).
B. Bollobas, I. Simon, “On the Expected Behavior of Disjoint Set-Union Algorithms”, Proc. 17th ACM Symp. on Theory of Computing (1985).
J.R. Driscoll, N. Sarnak, D.D. Sleator, R.E. Tarjan, “Making Data Structures Persistent”, Proc. 18th Symp. on Theory of Computing STOC (1986).
M.J. Fischer, “Efficiency of Equivalence Algorithms”, in Complexity of Computations, R.E. Miller and J.W. Thatcher, eds., Plenum Press, New York (1972).
H.N. Gabow, R.E. Tarjan, “A Linear Time Algorithm for a Special Case of Disjoint Set-Union”, Proc. 15th ACM Symp. on Theory of Computing (1983).
C. Gaibisso, G. Gambosi, M. Talamo, “A Partially Persistent Data Structure for the Set-Union Problem”, submitted to RAIRO Theoretical Informatics and Applications (1987).
B.A. Galler, M.J. Fischer, “An Improved Equivalence Algorithm”, Comm. ACM 7 (1964).
G. Gambosi, G.F. Italiano. M. Talamo, “Worst Case Analysis of the Set-Union Problem with Backtracking”, to appear on “Theoretical Computer Science” (1988).
J.E. Hopcroft, J.D. Ullman, “Set Merging Algorithms”, SIAM J. Comput. 2 (1973).
H. Mannila, E. Ukkonen, “The Set-Union Problem with Backtracking”, Proc. 13th ICALP (1986).
R.E. Tarjan, “Efficiency of a Good but not Linear Disjoint Set-Union Algorithm”, J. ACM 22 (1975).
R.E. Tarjan, “A Class of Algorithms which Require Linear Time To Maintain Disjoint Sets”, J. Computer and System Sciences 18 (1979).
R.E. Tarjan, “Amortized Computational Complexity”, SIAM J. Alg. Discr. Meth. 6 (1985).
R.E. Tarjan, J. van Leeuwen, “Worst Case Analysis of Set-Union Algorithms”, J. ACM 31 (1984).
J. van Leeuwen, T. van der Weide, “Alternative Path Compression Techniques”, Techn. Rep. RUU-CS-77-3, Rijksuniversiteit Utrecht, The Netherlands
J. Westbrook, R.E. Tarjan, “Amortized Analysis of Algorithms for Set-Union with Backtracking”, Tech. Rep. TR-103-87, Dept. of Computer Sciences, Princeton University (1987).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gaibisso, C. (1989). A partially persistent data structure for the set-union problem with backtracking. In: Dassow, J., Kelemen, J. (eds) Machines, Languages, and Complexity. IMYCS 1988. Lecture Notes in Computer Science, vol 381. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0015933
Download citation
DOI: https://doi.org/10.1007/BFb0015933
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51516-6
Online ISBN: 978-3-540-48203-1
eBook Packages: Springer Book Archive