Abstract
We consider a variant of the set union problem, called set union with arbitrary deunions, that consists of maintaining a collection of disjoint sets under three kinds of operations: union, find, and deunion( i). A deunion( i) undoes the ith union performed so far and not yet undone. Each operation can be supported in O(log n) time in the worst-case, where n is the total number of items in the collection of disjoint sets. Motivations for this problem arise in logic programming memory management.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
