识别页码为2的DAG是NP完全的
Recognizing DAGs with Page-Number 2 is NP-complete
摘要:
有向无环图(简称DAG)的页码是最小的$k$,对于该最小的$k$,DAG具有拓扑序和其边的$k$ -着色,使得没有两个相同颜色的边交叉,即,沿着拓扑顺序具有交替的端点。在1999年,Heath和Pemmaraju证明了具有页号$2$的DAG的识别是NP完全的,并且证明了识别具有页号$6$的DAG是NP完全的[SIAM J. Computing,1999]。Binucci等人最近通过证明对于每个$k\geq 3$,识别具有页码$k$的DAG是NP完全的,加强了这一结果[SoCG 2019]。本文最终肯定地解决了Heath和Pemmaraju猜想。特别地,我们的NP-完全性结果甚至对$st$ -平面图和平面偏序集也成立。
英文摘要:
The page-number of a directed acyclic graph (a DAG, for short) is the minimum $k$ for which the DAG has a topological order and a $k$-coloring of its edges such that no two edges of the same color cross, i.e., have alternating endpoints along the topological order. In 1999, Heath and Pemmaraju conjectured that the recognition of DAGs with page-number $2$ is NP-complete and proved that recognizing DAGs with page-number $6$ is NP-complete [SIAM J. Computing, 1999]. Binucci et al. recently strengthened this result by proving that recognizing DAGs with page-number $k$ is NP-complete, for every $k\geq 3$ [SoCG 2019]. In this paper, we finally resolve Heath and Pemmaraju's conjecture in the affirmative. In particular, our NP-completeness result holds even for $st$-planar graphs and planar posets.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。