Counting Minimal Transversals of ß-Acyclic Hypergraphs
Résumé
We prove that one can count in polynomial time the number of minimal transversals of $\beta$-acyclic hypergraphs. As consequence, we can count in polynomial time the number of minimal dominating sets of strongly chordal graphs, continuing the line of research initiated in [M.M. Kanté and T. Uno, Counting Minimal Dominating Sets, TAMC'17].
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|
Loading...