Counting Minimal Transversals of β-Acyclic Hypergraphs
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:5NT5ZWRKrecord.jsonopen to challenge →
classification
cs.DS
keywords
minimalacyclicbetacountcountingdominatinghypergraphsnumber
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.