Pages that link to "Item:Q1333159"
From MaRDI portal
The following pages link to Exact transversal hypergraphs and application to Boolean \(\mu\)-functions (Q1333159):
Displaying 16 items.
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets (Q494806) (← links)
- Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry (Q708383) (← links)
- A global parallel algorithm for the hypergraph transversal problem (Q845919) (← links)
- Enumerating minimal dominating sets in chordal bipartite graphs (Q896653) (← links)
- Computational aspects of monotone dualization: a brief survey (Q943839) (← links)
- On the complexity of monotone dualization and generating minimal hypergraph transversals (Q943847) (← links)
- Decomposing complete edge-chromatic graphs and hypergraphs. Revisited (Q967361) (← links)
- A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs (Q1733046) (← links)
- Efficiently enumerating hitting sets of hypergraphs arising in data profiling (Q2051864) (← links)
- A combinatorial approach to nonlocality and contextuality (Q2258010) (← links)
- Resolution based algorithms for the transversal hypergraph generation problem (Q2310740) (← links)
- On the fixed-parameter tractability of the equivalence test of monotone normal forms (Q2379965) (← links)
- Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games (Q2515585) (← links)
- Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices (Q5220475) (← links)
- Decision lists and related Boolean functions (Q5958318) (← links)
- Compression with wildcards: all exact or all minimal hitting sets (Q6083242) (← links)
