{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T19:31:16Z","timestamp":1787340676339,"version":"build-2736575974"},"reference-count":13,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Comput."],"published-print":{"date-parts":[[1989,2]]},"abstract":"<jats:p>Mannila and Ukkonen [Lecture Notes in Computer Science 225, Springer-Verlag, New York, 1986, pp. 236\u2013243] have studied a variant of the classical disjoint set union (equivalence) problem in which an extra operation, called de-union, can undo the most recently performed union operation not yet undone. They proposed a way to modify standard set union algorithms to handle de-union operations. In this paper several algorithms are analyzed based on their approach. The most efficient such algorithms have an amortized running time of $O({{\\log n} \/ {\\log \\log n}})$ per operation, where n is the total number of elements in all the sets. These algorithms use $O(n\\log n)$ space, but the space usage can be reduced to $O(n)$ by a simple change. The authors prove that any separable pointer-based algorithm for the problem requires $\\Omega ({{\\log n} \/ {\\log \\log n}})$ time per operation, thus showing that our upper bound on amortized time is tight.<\/jats:p>","DOI":"10.1137\/0218001","type":"journal-article","created":{"date-parts":[[2005,2,24]],"date-time":"2005-02-24T06:32:44Z","timestamp":1109226764000},"page":"1-11","source":"Crossref","is-referenced-by-count":17,"title":["Amortized Analysis of Algorithms for Set Union with Backtracking"],"prefix":"10.1137","volume":"18","author":[{"given":"Jeffery","family":"Westbrook","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Robert E.","family":"Tarjan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2006,7,13]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1137\/0215072"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(85)90014-5"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0035827"},{"key":"R4","volume-title":"The Art of Computer Programming, Vol. 1, Fundamental Algorithms","author":"Knuth D. E.","year":"1968"},{"key":"R5","first-page":"175","volume":"8","author":"Kolmogorov A. N.","year":"1953","journal-title":"Uspekhi Mat. Nauk"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"H. Mannila, E. Ukkonen,  On the complexity of unification sequences,  3rd International Conference on Logic Programming, July 14\u201318, 1986, Lecture Notes in Computer Science 225, Springer-Verlag, New York,  1986,  122\u2013133 0614.68064","DOI":"10.1007\/3-540-16492-8_69"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-16761-7_73"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-18088-5_41"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1137\/0209036"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1145\/321879.321884"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(79)90042-4"},{"key":"R12","doi-asserted-by":"publisher","DOI":"10.1137\/0606031"},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1145\/62.2160"}],"container-title":["SIAM Journal on Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/0218001","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T18:43:36Z","timestamp":1787337816000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/0218001"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,2]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1989,2]]}},"alternative-id":["10.1137\/0218001"],"URL":"https:\/\/doi.org\/10.1137\/0218001","relation":{},"ISSN":["0097-5397","1095-7111"],"issn-type":[{"value":"0097-5397","type":"print"},{"value":"1095-7111","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,2]]}}}