A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Worst-case analysis of the set-union problem with extended backtracking
1989
Theoretical Computer Science
In this paper, an extension of the well known set union problem is considered, where backtracking over sequences of Union operations is allowed. A data structure is presented which maintains a partition of zn n-item set making it possible to perform each Union in O(1g lg n) time, each Find in O(lg n) time and allows backtracking over the Unions in O(1) time. Moreover, it is shown that the data structure can be slightly modified as to present an O(k i-in lg n) time complexity on a sequence of k
doi:10.1016/0304-3975(89)90119-9
fatcat:ezn6iw2rkrfhnkpzjbeidfzkfu