Computing the subset partial order for dense families of sets
From MaRDI portal
Publication:989580
DOI10.1016/J.IPL.2009.07.001zbMATH Open1202.68473OpenAlexW2011719343MaRDI QIDQ989580FDOQ989580
Authors: 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
Recommendations
Cites Work
- Finding extremal sets in less than quadratic time
- Fast sequential and parallel algorithms for finding extremal sets
- An old sub-quadratic algorithm for finding extremal sets
- 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
- On the size of the subset partial order
- Title not available (Why is that?)
- On Computing the Subset Graph of a Collection of Sets
- Fully dynamic algorithms for maintaining extremal sets in a family of sets∗
Cited In (7)
- Computing the union join and subset graph of acyclic hypergraphs in subquadratic time
- On the complexity of strongly connected components in directed hypergraphs
- On Computing the Subset Graph of a Collection of Sets
- Title not available (Why is that?)
- On the size of the subset partial order
- Finding extremal sets in less than quadratic time
- The subset partial order: computing and combinatorics
This page was built for publication: Computing the subset partial order for dense families of sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q989580)
