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

Stick、BipHook和Max点容差图的识别复杂性

On the complexity of recognizing Stick, BipHook and Max Point-Tolerance graphs

Irena Rusu

摘要:

棒形图定义如下。设A(分别为B)是平面中的一组垂直(分别为水平)线段,使得A中线段的底端和B中线段的左端位于斜率为-1的同一条地面直线上。由A和B定义的棒图是A中的线段与B中的线段的交图,它必然是二分的。我们回答了一个公开的问题,表明识别棒图是NP-完全的。这一结果使我们能够很容易地解决其他两个开放的问题,即识别的BipHook图和最大点公差图。我们证明了这两个问题都是NP完全问题。

英文摘要:

Stick graphs are defined as follows. Let A (respectively B) be a set of vertical (respectively horizontal) segments in the plane such that the bottom endpoints of the segments in A and the left endpoints of the segments in B lie on the same ground straight line with slope -1. The Stick graph defined by A and B, which is necessarily bipartite, is the intersection graph of the segments in A with the segments in B. We answer an open problem by showing that recognizing Stick graphs is NP-complete. This result allows us to easily solve two other open problems, namely the recognition of BipHook graphs and of max point-tolerance graphs. We show that both of them are NP-complete problems.

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

↑