arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2309.01463cs.CG
收藏

同构树的互见证邻近图绘制

Mutual Witness Proximity Drawings of Isomorphic Trees

Carolina Haase, Philipp Kindermann, William J. Lenhart, Giuseppe Liotta

AI总结:

本文证明任意两棵同构树在任意β邻近规则下均存在互见证邻近绘制,并构造了鲁棒性修剪方法及线性可分离的Gabriel绘制。

摘要:

一对图$\langle G_0, G_1 \rangle$允许一个互见证邻近图绘制$\langle Γ_0, Γ_1 \rangle$,当且仅当:(i) $Γ_i$表示$G_i$,且(ii) 在$Γ_i$中存在一条边$(u,v)$当且仅当在$Γ_{1-i}$中不存在一个顶点$w$与$u$和$v$都“过于接近”($i=0,1$)。在本文中,我们通过采用$β$-邻近规则(对任意$β\in [1,\infty]$)考虑了无限多种“接近”的定义,并研究了允许互见证$β$-邻近绘制的同构树对。具体来说,我们证明了任意两棵同构树对于任意$β\in [1,\infty]$都允许一个互见证$β$-邻近绘制。该构造技术可以做到“鲁棒”:对于某些树对,我们可以从两棵树中的一棵适当地修剪掉线性数量的叶子,但仍然保持它们的互见证$β$-邻近可绘制性。值得注意的是,在同构毛毛虫和$β=1$的特殊情况下,我们构造了线性可分离的互见证Gabriel绘制。

英文摘要:

A pair $\langle G_0, G_1 \rangle$ of graphs admits a mutual witness proximity drawing $\langle Γ_0, Γ_1 \rangle$ when: (i) $Γ_i$ represents $G_i$, and (ii) there is an edge $(u,v)$ in $Γ_i$ if and only if there is no vertex $w$ in $Γ_{1-i}$ that is ``too close'' to both $u$ and $v$ ($i=0,1$). In this paper, we consider infinitely many definitions of closeness by adopting the $β$-proximity rule for any $β\in [1,\infty]$ and study pairs of isomorphic trees that admit a mutual witness $β$-proximity drawing. Specifically, we show that every two isomorphic trees admit a mutual witness $β$-proximity drawing for any $β\in [1,\infty]$. The constructive technique can be made ``robust'': For some tree pairs we can suitably prune linearly many leaves from one of the two trees and still retain their mutual witness $β$-proximity drawability. Notably, in the special case of isomorphic caterpillars and $β=1$, we construct linearly separable mutual witness Gabriel drawings.

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

↑