Mohamed Nidhal Jelassi

Learn More
The problem of extracting the minimal transversals from a hypergraph is known to be particularly difficult. Given that the number of minimal transversals can be exponential even for moderately sized hypergraphs, we propose, in this paper, a concise representation of minimal transversals in order to optimize the computation time and we introduce a new(More)
  • 1