Counting Minimal Transversals of ß-Acyclic Hypergraphs

Abstract : 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].
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [19 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01610959
Contributor : Benjamin Bergougnoux <>
Submitted on : Wednesday, August 15, 2018 - 11:45:45 AM
Last modification on : Monday, January 20, 2020 - 12:14:06 PM

File

JCSS_R1.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01610959, version 2

Citation

Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté. Counting Minimal Transversals of ß-Acyclic Hypergraphs . 2018. ⟨hal-01610959v2⟩

Share

Metrics

Record views

85

Files downloads

136