Exact transversal hypergraphs and application to Boolean \(\mu\)-functions
From MaRDI portal
Publication:1333159
DOI10.1006/jsco.1994.1013zbMath0809.94032OpenAlexW2058509996MaRDI QIDQ1333159
Publication date: 13 September 1994
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/6eb048607be5b7ad96a51fd604790b6b4decd3c1
Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).
Related Items (16)
A global parallel algorithm for the hypergraph transversal problem ⋮ On the fixed-parameter tractability of the equivalence test of monotone normal forms ⋮ Compression with wildcards: all exact or all minimal hitting sets ⋮ Enumerating minimal dominating sets in chordal bipartite graphs ⋮ A global parallel algorithm for enumerating minimal transversals of geometric hypergraphs ⋮ An incremental polynomial time algorithm to enumerate all minimal edge dominating sets ⋮ Computational aspects of monotone dualization: a brief survey ⋮ On the complexity of monotone dualization and generating minimal hypergraph transversals ⋮ Decomposing complete edge-chromatic graphs and hypergraphs. Revisited ⋮ A combinatorial approach to nonlocality and contextuality ⋮ Polynomial-time dualization of \(r\)-exact hypergraphs with applications in geometry ⋮ Decision lists and related Boolean functions ⋮ Sandwich problem for \(\varPi\)- and \(\varDelta\)-free multigraphs and its applications to positional games ⋮ Efficiently enumerating hitting sets of hypergraphs arising in data profiling ⋮ Enumerating Vertices of Covering Polyhedra with Totally Unimodular Constraint Matrices ⋮ Resolution based algorithms for the transversal hypergraph generation problem
This page was built for publication: Exact transversal hypergraphs and application to Boolean \(\mu\)-functions
