The reviewed record of science sign in
Pith

arxiv: 1808.05017 · v1 · pith:5NT5ZWRK · submitted 2018-08-15 · cs.DS

Counting Minimal Transversals of β-Acyclic Hypergraphs

Benjamin Bergougnoux , Florent Capelli , Mamadou Moustapha Kant\'e This is my paper

Reviewed by Pithpith:5NT5ZWRKopen to challenge →

classification cs.DS
keywords minimalacyclicbetacountcountingdominatinghypergraphsnumber
0
0 comments X
read the original abstract

We prove that one can count in polynomial time the number of minimal transversals of $\beta$-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\'e and T. Uno, Counting Minimal Dominating Sets, TAMC'17].

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.