Counting minimal transversals of β-acyclic hypergraphs
作者：
Highlights：
•
摘要
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 (2017) [18].
论文关键词：Counting problem,Minimal transversals,Dominating sets,β-Acyclic hypergraphs,Strongly chordal graphs
论文评审过程：Received 12 July 2017, Revised 13 July 2018, Accepted 29 October 2018, Available online 14 November 2018, Version of Record 20 December 2018.
论文官网地址：https://doi.org/10.1016/j.jcss.2018.10.002
