arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1808.05017cs.DS
收藏

$β$ -无圈超图的最小断面计数

Counting Minimal Transversals of $β$-Acyclic Hypergraphs

Benjamin Bergougnoux, Florent Capelli, Mamadou Moustapha Kanté

摘要:

证明了$β$ -无圈超图的最小断面数可以在多项式时间内计数。因此,我们可以在多项式时间内计算强弦图的最小控制集的个数,继续[M. M. Kanté和T. Uno,Counting Minimal Dominating Sets,TAMC'17]。

英文摘要:

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

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑