Recommendations
- The subset partial order: computing and combinatorics
- Computing the subset partial order for dense families of sets
- A simple sub-quadratic algorithm for computing the subset partial order
- On Computing the Subset Graph of a Collection of Sets
- A fast bit-parallel algorithm for computing the subset partial order
Cites work
- 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
- Computing the subset partial order for dense families of sets
- Fast sequential and parallel algorithms for finding extremal sets
- Finding extremal sets in less than quadratic time
- scientific article; zbMATH DE number 742985 (Why is no real title available?)
- On Computing the Subset Graph of a Collection of Sets
- Opportunistic algorithms for eliminating supersets
- The subset partial order: computing and combinatorics
Cited in
(7)- A bound on the overlap of same-sized subsets
- A fast bit-parallel algorithm for computing the subset partial order
- Partial order on a family of \(k\)-subsets of a linearly ordered set
- On Computing the Subset Graph of a Collection of Sets
- The subset partial order: computing and combinatorics
- scientific article; zbMATH DE number 5592511 (Why is no real title available?)
- Computing the subset partial order for dense families of sets
This page was built for publication: On the size of the subset partial order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q436580)