A simple sub-quadratic algorithm for computing the subset partial order
From MaRDI portal
Publication:672836
DOI10.1016/0020-0190(95)00165-4zbMATH Open0875.68463OpenAlexW2069684871MaRDI QIDQ672836FDOQ672836
Authors: Paul A. Pritchard 
Publication date: 28 February 1997
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(95)00165-4
Recommendations
Cites Work
- Dynamic Perfect Hashing: Upper and Lower Bounds
- On the computational power of pushdown automata
- Three Partition Refinement Algorithms
- Finding extremal sets in less than quadratic time
- An old sub-quadratic algorithm for finding extremal sets
- Opportunistic algorithms for eliminating supersets
- A fast bit-parallel algorithm for computing the subset partial order
- On Computing the Subset Graph of a Collection of Sets
Cited In (13)
- 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?)
- An old sub-quadratic algorithm for finding extremal sets
- Positional dominance: concepts and algorithms
- On the size of the subset partial order
- Computing the subset partial order for dense families of sets
- Best match graphs
- Minimal approximate hitting sets and rule templates
- Title not available (Why is that?)
- The subset partial order: computing and combinatorics
- Title not available (Why is that?)
- Title not available (Why is that?)
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)
