Computing the subset partial order for dense families of sets
From MaRDI portal
(Redirected from Publication:989580)
Recommendations
Cites work
- scientific article; zbMATH DE number 742985 (Why is no real title available?)
- A fast bit-parallel algorithm for computing the subset partial order
- A simple sub-quadratic algorithm for computing the subset partial order
- An old sub-quadratic algorithm for finding extremal sets
- Fast sequential and parallel algorithms for finding extremal sets
- Finding extremal sets in less than quadratic time
- Fully dynamic algorithms for maintaining extremal sets in a family of sets∗
- On Computing the Subset Graph of a Collection of Sets
- On the size of the subset partial order
- Opportunistic algorithms for eliminating supersets
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
- scientific article; zbMATH DE number 742985 (Why is no real title available?)
- 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)