Answers are grounded in this paper and cite their sources.
This paper surveys algorithmic techniques and data structures that have been proposed to solve the set union problem and its variants. Their discovery required a new set of algorithmic tools that have proven useful in other areas. Special attention is devoted to recent extensions of the original set union problem, and some effort is made to provide a unifying theoretical framework for this growing body of algorithms.
No takes yet. Share an insight, caveat, or question.
Galil et al. (1991) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: