An output sensitive solution to the set union and intersection problem

DOI10.1007/BFB0037417MaRDI QIDQ6560190zbMATH OpenFDO

Authors Carlo Gaibisso, Enrico Nardelli, Guido Proietti

Publication date 21 June 2024

zbMATH Keywords

set intersectionset union

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Nonnumerical algorithms (68W05)

Recommendations

• Intersection reporting on two collections of disjoint sets
• Combinatorial Pattern Matching
• Fast Evaluation of Union-Intersection Expressions
• Fast set intersection and two-patterns matching
• scientific article; zbMATH DE number 437544

Cites work

• A class of algorithms which require nonlinear time to maintain disjoint sets
• On the Single-Operation Worst-Case Time Complexity of the Disjoint Set Union Problem
• Worst-case Analysis of Set Union Algorithms

This page was built for publication: An output sensitive solution to the set union and intersection problem

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