区间数为4的区间图的最大割是NP完全的
Maximum cut on interval graphs of interval count four is NP-complete
摘要:
限制于区间图的MaxCut问题的计算复杂性自80年代以来一直是公开的,是Johnson在他的Ongoing Guide to NP-完全性中提出的问题之一,并且直到最近才被Adhikary,Bose,Mukherjee和Roy解决为NP-完全的。另一方面,多年来已经提出了许多关于MaxCut在更严格的单位/适当区间图(或区间数为1的图)类上的多项式性的有缺陷的证明,并且问题的分类仍然未知。在本文中,我们提出了第一个NP-完全性证明的MaxCut时,限制到区间图有界的区间数,即图的区间数为4。
英文摘要:
The computational complexity of the MaxCut problem restricted to interval graphs has been open since the 80's, being one of the problems proposed by Johnson on his Ongoing Guide to NP-completeness, and has been settled as NP-complete only recently by Adhikary, Bose, Mukherjee and Roy. On the other hand, many flawed proofs of polynomiality for MaxCut on the more restrictive class of unit/proper interval graphs (or graphs with interval count 1) have been presented along the years, and the classification of the problem is still unknown. In this paper, we present the first NP-completeness proof for MaxCut when restricted to interval graphs with bounded interval count, namely graphs with interval count 4.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。