Generating minimal redundant and maximal irredundant sets in incidence graphs

Emanuel Castelo, Jérémie Chalopin, Oscar Defrain +1

It has been proved by Boros and Makino that there is no output-polynomial-time algorithm enumerating the minimal redundant sets or the maximal irredundant sets of a hypergraph, unl…