Abstract
In this paper we propose an alternative approaches for the efficient solution of the set union and intersection problem, a variant of the classical disjoint set union problem, in which two distinct sequences of unions are simultaneously performed on two distinct collections of n singletons. In this context, it makes sense to introduce a new operation, named findint(x), that, given an element x, returns the intersection of the two sets containing x in both collections. We use a new data structures called intersection lists that reaches the optimal Θ(p) worst case time for executing a findint operation, where p is the size of the output, and spends O(n) worst case time for a union and O(1) worst case time for a find operation.
Preview
Unable to display preview. Download preview PDF.
References
N. Blum, On the Single Operation Worst-case Time Complexity of Disjoint Set Union Problems, in SIAM Journal on Computing, 15, 1986, pp. 1021–1024.
C.Gaibisso, E.Nardelli and G.Proietti, Algorithms for the Set Union and Intersection Problem, Technical Report no 83 April 1995 of the Department of Pure and Applied Mathematics of the University of L'Aquila.
C.Gaibisso, E.Nardelli and G.Proietti, Intersection Reporting on two Collection of Disjoint Sets, submitted to Information Processing Letters, April 1996.
Z. Galil and G.F. Italiano, Data Structures and Algorithms for Disjoint Set Union Problems, in ACM Computing Surveys, 23 (3), 1991, pp. 319–344.
R.E. Tarjan, A Class of Algorithms which Require Nonlinear Time to Maintain Disjoint Sets, in Journal of Computer and System Sciences, 18, 1979, pp. 110–127.
R.E. Tarjan and J. Van Leeuwen, Worst-Case Analysis of Set Union Algorithms, in Journal of the Association for Computing Machinery, 31 (2), 1984, pp. 245–281.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gaibisso, C., Nardelli, E., Proietti, G. (1996). An output sensitive solution to the set union and intersection problem. In: Jeffery, K.G., Král, J., Bartošek, M. (eds) SOFSEM'96: Theory and Practice of Informatics. SOFSEM 1996. Lecture Notes in Computer Science, vol 1175. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0037417
Download citation
DOI: https://doi.org/10.1007/BFb0037417
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61994-9
Online ISBN: 978-3-540-49588-8
eBook Packages: Springer Book Archive