A simple sub-quadratic algorithm for computing the subset partial order
From MaRDI portal
(Redirected from Publication:672836)
Recommendations
Cites work
- A fast bit-parallel algorithm for computing the subset partial order
- An old sub-quadratic algorithm for finding extremal sets
- Dynamic Perfect Hashing: Upper and Lower Bounds
- Finding extremal sets in less than quadratic time
- On Computing the Subset Graph of a Collection of Sets
- On the computational power of pushdown automata
- Opportunistic algorithms for eliminating supersets
- Three Partition Refinement Algorithms
Cited in
(13)- On the complexity of strongly connected components in directed hypergraphs
- On Computing the Subset Graph of a Collection of Sets
- An old sub-quadratic algorithm for finding extremal sets
- scientific article; zbMATH DE number 742985 (Why is no real title available?)
- On the size of the subset partial order
- Positional dominance: concepts and algorithms
- Computing the subset partial order for dense families of sets
- Best match graphs
- Minimal approximate hitting sets and rule templates
- scientific article; zbMATH DE number 1880331 (Why is no real title available?)
- The subset partial order: computing and combinatorics
- scientific article; zbMATH DE number 3851100 (Why is no real title available?)
- scientific article; zbMATH DE number 3936499 (Why is no real title available?)
This page was built for publication: A simple sub-quadratic algorithm for computing the subset partial order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672836)