Pages that link to "Item:Q758205"
From MaRDI portal
The following pages link to Opportunistic algorithms for eliminating supersets (Q758205):
Displaying 11 items.
- An old sub-quadratic algorithm for finding extremal sets (Q287109) (← links)
- On the size of the subset partial order (Q436580) (← links)
- On the complexity of strongly connected components in directed hypergraphs (Q517789) (← links)
- A simple sub-quadratic algorithm for computing the subset partial order (Q672836) (← links)
- Computing the union join and subset graph of acyclic hypergraphs in subquadratic time (Q832905) (← links)
- Computing the subset partial order for dense families of sets (Q989580) (← links)
- Finding extremal sets in less than quadratic time (Q1313720) (← links)
- Minimal sets on propositional formulae. Problems and reductions (Q1677431) (← links)
- Fast sequential and parallel algorithms for finding extremal sets (Q2710788) (← links)
- Fully dynamic algorithms for maintaining extremal sets in a family of sets<sup>∗</sup> (Q4256125) (← links)
- Practical Algorithms for Finding Extremal Sets (Q5266618) (← links)
