Intersection reporting on two collections of disjoint sets

Authors:
Carlo Gaibisso;Enrico Nardelli;Guido Proietti
Affiliations:
Istituto di Analisi del Sistemi ed Informatica, C.N.R., Viale Manzoni 30, 00185 Roma, Italy;Istituto di Analisi del Sistemi ed Informatica, C.N.R., Viale Manzoni 30, 00185 Roma, Italy and Dipartimento di Matematica Pura ed Applicata, Università di L'Aquila, Via Vetoio, Coppito, 6701 ...;Dipartimento di Matematica Pura ed Applicata, Università di L'Aquila, Via Vetoio, Coppito, 67010 L'Aquila, Italy
Venue:
Information Sciences: an International Journal
Year:
1999

Citing 10
Cited 1

Worst-case Analysis of Set Union Algorithms

Journal of the ACM (JACM)
On the single-operation worst-case time complexity of the disjoint set union problem

SIAM Journal on Computing
Combinatorial optimization: algorithms and complexity

Combinatorial optimization: algorithms and complexity
Constraint logic programming languages

Communications of the ACM
Introduction to algorithms

Introduction to algorithms
Concurrent constraint programming

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Data structures and algorithms for disjoint set union problems

ACM Computing Surveys (CSUR)
Concurrent constraint programming

Concurrent constraint programming
A data structure for manipulating priority queues

Communications of the ACM
An introduction to spatial database systems

The VLDB Journal — The International Journal on Very Large Data Bases - Spatial Database Systems

Efficient unbalanced merge-sort

Information Sciences: an International Journal

Quantified Score

Hi-index	0.07

Visualization

Abstract

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.