The Transversal Hypergraph Generation problem

The Transversal Hypergraph Generation problem is the problem of generating all minimal hitting sets (transversals) of a hypergraph.

Kavvadias and Stavropoulos have implemented an efficient algorithm for the problem [WAE99, JGAA05].

A linux-executable is available here (use switch -h for help).

References

[WAE99] D. J. Kavvadias and E. C. Stavropoulos, Evaluation of an Algorithm for the Transversal Hypergraph Problem. In Proc. of the 3rd Workshop on Algorithm Engineering (WAE'99), LNCS 1668, pp. 72-84, 1999. [pdf]

[JGAA05] D. J. Kavvadias and E. C. Stavropoulos, An Efficient Algorithm for the Transversal Hypergraph Generation. Journal of Graph Algorithms and Applications, to appear.