Exact algorithms for finding minimum transversals in rank-3 hypergraphs.

Magnus Wahlström Exact algorithms for finding minimum transversals in rank-3 hypergraphs. 107-121 2004 51 J. Algorithms 2 http://dx.doi.org/10.1016/j.jalgor.2004.01.001 db/journals/jal/jal51.html#Wahlstrom04