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

上可比图中独立集的计数

Counting Independent Sets in Cocomparability Graphs

Martin Dyer, Haiko Müller

摘要:

我们证明了在协可比图中的独立集的数量可以在线性时间内计数,在可比图中也可以计数团。相比之下,计数可比较图中的团和计数可比较图中的独立集是#P-完全的。我们将这些结果推广到计算最大团和独立集。我们还考虑了固定参数版本的计数团和独立集的大小$k$。最后,我们结合这些结果,证明了置换图中的计数团和独立集都是线性时间的。

英文摘要:

We show that the number of independent sets in cocomparability graphs can be counted in linear time, as can counting cliques in comparability graphs. By contrast, counting cliques in cocomparabilty graphs and counting independent sets in comparability graphs are #P-complete. We extend these results to counting maximal cliques and independent sets. We also consider the fixed-parameter versions of counting cliques and independent sets of given size $k$. Finally, we combine the results to show that both counting cliques and independent sets in permutation graphs are in linear time.

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

↑