Intersection reporting on two collections of disjoint sets

DOI10.1016/S0020-0255(99)80001-2MaRDI QIDQ1818976zbMATH OpenOpenAlexFDO

Authors Carlo Gaibisso, Enrico Nardelli, Guido Proietti

Publication date 5 January 2000

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0020-0255(99)80001-2

zbMATH Keywords

binomial listdata structure

Mathematics Subject Classification ID

Data structures (68P05) Database theory (68P15)

Recommendations

• Combinatorial Pattern Matching
• Fast Evaluation of Union-Intersection Expressions
• A linear-time algorithm for a special case of disjoint set union
• scientific article; zbMATH DE number 3907792
• On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem

Cites work

• A class of algorithms which require nonlinear time to maintain disjoint sets
• A data structure for manipulating priority queues
• scientific article; zbMATH DE number 5542185 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
• Truly concurrent constraint programming
• Worst-case Analysis of Set Union Algorithms

Cited in

(4)

• Intersection queries in sets of disks
• Reporting and counting segment intersections
• Efficient unbalanced merge-sort
• An output sensitive solution to the set union and intersection problem

This page was built for publication: Intersection reporting on two collections of disjoint sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1818976)