Computing the subset partial order for dense families of sets

DOI10.1016/j.ipl.2009.07.001zbMath1202.68473OpenAlexW2011719343MaRDI QIDQ989580

Amr Elmasry

Publication date: 20 August 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2009.07.001

zbMATH Keywords

algorithmsdata structuresalgorithm design and analysis

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Data structures (68P05)

Related Items (3)

Computing the union join and subset graph of acyclic hypergraphs in subquadratic time ⋮ On the size of the subset partial order ⋮ On the complexity of strongly connected components in directed hypergraphs

Cites Work

• Unnamed Item
• An old sub-quadratic algorithm for finding extremal sets
• On the size of the subset partial order
• A simple sub-quadratic algorithm for computing the subset partial order
• Opportunistic algorithms for eliminating supersets
• A fast bit-parallel algorithm for computing the subset partial order
• Finding extremal sets in less than quadratic time
• Fast sequential and parallel algorithms for finding extremal sets
• Fully dynamic algorithms for maintaining extremal sets in a family of sets^∗
• On Computing the Subset Graph of a Collection of Sets

This page was built for publication: Computing the subset partial order for dense families of sets