Counting Minimal Transversals of β-Acyclic Hypergraphs

We prove that one can count in polynomial time the number of minimal transversals of β-acyclic hypergraphs. In 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].

Keywords

Counting problem Minimal transversals Dominating sets β-Acyclic Hypergraphs Strongly chordal graphs

Domains

Data Structures and Algorithms [cs.DS]

Florent Capelli : Connect in order to contact the contributor

https://inria.hal.science/hal-01923090

Submitted on : Wednesday, November 14, 2018-10:28:44 PM

Last modification on : Friday, October 18, 2024-3:09:21 AM

Dates and versions

hal-01923090 , version 1 (14-11-2018)

Identifiers

HAL Id : hal-01923090 , version 1
ARXIV : 1808.05017
DOI : 10.1016/j.jcss.2018.10.002

Cite

Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté. Counting Minimal Transversals of β-Acyclic Hypergraphs. Journal of Computer and System Sciences, 2019, ⟨10.1016/j.jcss.2018.10.002⟩. ⟨hal-01923090⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

PRES_CLERMONT CNRS INRIA UNIV-BORDEAUX LIMOS CRISTAL INRIA2 CRISTAL-LINKS UNIV-LILLE ANR CLERMONT-AUVERGNE-INP

92 View

0 Download