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

向上点集可嵌入性

Upward Point-Set Embeddability

Markus Geyer, Michael Kaufmann, Tamara Mchedlidze, Antonios Symvonis

摘要:

研究了点集的向上可嵌入性问题,即判定给定的向上平面有向图$D$是否有向上平面嵌入到点集$S$中的问题.我们证明了任何开关树都允许向上平面直线嵌入到任何凸点集。对于类的$k$开关树,这是一个推广的开关树(根据这个定义的开关树是一个$1$开关树),我们表明,不是每一个$k$开关树承认一个向上的平面直线嵌入到任何凸点集,任何$k \geq 2$。最后证明了点集的可嵌入性问题是NP-完全的。

英文摘要:

We study the problem of Upward Point-Set Embeddability, that is the problem of deciding whether a given upward planar digraph $D$ has an upward planar embedding into a point set $S$. We show that any switch tree admits an upward planar straight-line embedding into any convex point set. For the class of $k$-switch trees, that is a generalization of switch trees (according to this definition a switch tree is a $1$-switch tree), we show that not every $k$-switch tree admits an upward planar straight-line embedding into any convex point set, for any $k \geq 2$. Finally we show that the problem of Upward Point-Set Embeddability is NP-complete.

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

↑