the exact complexity for hypergraph transversal problem is yet unknown and is an open research problem.
However, I would need a fast way to compute, on paper, the minimal transversal of a hypergraph. A transversal intersects all hyperedges of the graph.
A transversal is minimal if it does not contain any transversal as a proper subset.
Let us look at this example, where V = {a,b,c,d,e}
Hyperedge 1: de
Hyperedge 2: abce
Hyperedge 3: bd
How can I compute, on paper, the minimal transversal of this hypergraph? Computing the minimal transversal with only 2 hyperedges is trivial, but in the 3 hyperedges case, the complexity increases.
Looking forward to your input.