平面不连通图的相容连通性扩充
Compatible Connectivity-Augmentation of Planar Disconnected Graphs
摘要:
出于应用程序的图形变形,我们考虑以下\emph{compatible connectivity-augmentation problem}:我们给出了一个标记的$n$ -顶点平面图,$\mathcal{G}$,它有$r\ge 2$连接组件,和$k\ge 2$同构平面直线图,$G_1,\ldots,G_k$,$\mathcal{G}$。我们希望通过添加顶点和边来增强$\mathcal G$,使其以这样一种方式连接,即这些顶点和边可以分别作为点和直线段添加到$G_1,\ldots,G_k$中,以获得与$\mathcal G$的增强同构的$k$平面直线图。我们表明,添加$Θ(nr^{1-1/k})$边缘和顶点到$\mathcal{G}$总是足够的,有时是必要的,以实现这一目标。上限对所有$r\in\{2,\ldots,n\}$和$k\ge 2$都成立,并且可以通过一种算法来实现,该算法的运行时间对于$k=O(1)$是$O(nr^{1-1/k})$,对于$k$的一般值是$O(kn^2)$。下限适用于所有$r\in\{2,\ldots,n/4\}$和$k\ge 2$。
英文摘要:
Motivated by applications to graph morphing, we consider the following \emph{compatible connectivity-augmentation problem}: We are given a labelled $n$-vertex planar graph, $\mathcal{G}$, that has $r\ge 2$ connected components, and $k\ge 2$ isomorphic planar straight-line drawings, $G_1,\ldots,G_k$, of $\mathcal{G}$. We wish to augment $\mathcal G$ by adding vertices and edges to make it connected in such a way that these vertices and edges can be added to $G_1,\ldots,G_k$ as points and straight-line segments, respectively, to obtain $k$ planar straight-line drawings isomorphic to the augmentation of $\mathcal G$. We show that adding $Θ(nr^{1-1/k})$ edges and vertices to $\mathcal{G}$ is always sufficient and sometimes necessary to achieve this goal. The upper bound holds for all $r\in\{2,\ldots,n\}$ and $k\ge 2$ and is achievable by an algorithm whose running time is $O(nr^{1-1/k})$ for $k=O(1)$ and whose running time is $O(kn^2)$ for general values of $k$. The lower bound holds for all $r\in\{2,\ldots,n/4\}$ and $k\ge 2$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。