相对邻域图及其相关图的经典问题仍是NP-难的
Most Classic Problems Remain NP-hard on Relative Neighborhood Graphs and their Relatives
摘要:
由于在计算几何、地理学、数据采掘和许多其他领域的应用,邻近图已经被研究了几十年。然而,经典的图问题的计算复杂性的邻近图大多仍然是开放的。我们现在研究3-着色性,控制集,反馈顶点集,哈密尔顿圈,独立集在邻近图类相对邻域图,Gabriel图,相对最近图。我们证明了所有的问题仍然是NP-困难的这些图,除了3-着色性和相对最近的图的Hamilton圈,其中前者是平凡的,后者是开放的。此外,对于每一个NP困难的情况下,我们还表明,没有$2^{o(n^{1/4})}$时间算法存在,除非ETH失败,其中n表示顶点的数量。
英文摘要:
Proximity graphs have been studied for several decades, motivated by applications in computational geometry, geography, data mining, and many other fields. However, the computational complexity of classic graph problems on proximity graphs mostly remained open. We now study 3-Colorability, Dominating Set, Feedback Vertex Set, Hamiltonian Cycle, and Independent Set on the proximity graph classes relative neighborhood graphs, Gabriel graphs, and relatively closest graphs. We prove that all of the problems remain NP-hard on these graphs, except for 3-Colorability and Hamiltonian Cycle on relatively closest graphs, where the former is trivial and the latter is left open. Moreover, for every NP-hard case we additionally show that no $2^{o(n^{1/4})}$-time algorithm exists unless the ETH fails, where n denotes the number of vertices.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。