Counting Minimal Transversals of β-Acyclic Hypergraphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Computer and System Sciences Year : 2019

Counting Minimal Transversals of β-Acyclic Hypergraphs

Abstract

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].

Dates and versions

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

Identifiers

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⟩
79 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More