Published 1999 in Inf. Sci.

In this paper we introduce a new quick-find data structure to represent disjoint sets, called binomial list, showing that it has a better single-operation worst case time complexity than any previously known approach in solving the set union and intersection problem, a variant of the classical disjoint set union problem. © 1999 Elsevier Science Inc. All… (More)