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

点可见性图识别是NP难的

Point visibility graph recognition is NP-hard

Bodhayan Roy

摘要:

给定一个3-SAT公式,可以在多项式时间内构造一个图,使得该图是点可见图当且仅当3-SAT公式是可满足的。这一减少建立了点可见性图的识别问题是NP难的。

英文摘要:

Given a 3-SAT formula, a graph can be constructed in polynomial time such that the graph is a point visibility graph if and only if the 3-SAT formula is satisfiable. This reduction establishes that the problem of recognition of point visibility graphs is NP-hard.

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

↑