arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 0905.3812cs.DScs.CGcs.DMcs.NI
收藏

关于3-连通平面图的凸贪婪嵌入猜想的一些结果

Some Results On Convex Greedy Embedding Conjecture for 3-Connected Planar Graphs

Subhas Kumar Ghosh, Koushik Sinha

摘要:

图$G = (V,E)$到度量空间$(X,d)$中的贪婪嵌入是一个函数$x : V(G) \to X$,使得在对每对不相邻的顶点$x(s), x(t)$的嵌入中,存在另一个与$x(s)$相邻的顶点$x(u)$,该顶点比$x(s)$更靠近$x(t)$。这种贪婪嵌入的概念是由Papadimitriou和Ratajczak(Theor. Comput. Sci. 2005),其中作者证明了每个3-连通平面图在欧几里得平面中有一个贪婪嵌入(可能是平面的和凸的)。最近,贪婪嵌入猜想已经被Leighton和Moitra证明(FOCS 2008)。然而,他们的算法并没有导致一个绘图是平面和凸的所有3-连通平面图在欧几里德平面。本文研究了平面凸贪婪嵌入猜想,并取得了一些进展。给出了平面凸贪婪嵌入的一个新的刻画:给定一个3连通平面图$G = (V,E)$,$G$的嵌入$x: V \to \bbbr^2$是平面凸贪婪嵌入当且仅当在嵌入$x$中,最大权生成树的权($T$)和最小权生成树的权($\func{MST}$)满足$\WT(T)/\WT(\func{MST}) \leq (\card{V}-1)^{1 - δ}$,对于某些$0 < δ\leq 1$ .

英文摘要:

A greedy embedding of a graph $G = (V,E)$ into a metric space $(X,d)$ is a function $x : V(G) \to X$ such that in the embedding for every pair of non-adjacent vertices $x(s), x(t)$ there exists another vertex $x(u)$ adjacent to $x(s)$ which is closer to $x(t)$ than $x(s)$. This notion of greedy embedding was defined by Papadimitriou and Ratajczak (Theor. Comput. Sci. 2005), where authors conjectured that every 3-connected planar graph has a greedy embedding (possibly planar and convex) in the Euclidean plane. Recently, greedy embedding conjecture has been proved by Leighton and Moitra (FOCS 2008). However, their algorithm do not result in a drawing that is planar and convex for all 3-connected planar graph in the Euclidean plane. In this work we consider the planar convex greedy embedding conjecture and make some progress. We derive a new characterization of planar convex greedy embedding that given a 3-connected planar graph $G = (V,E)$, an embedding $x: V \to \bbbr^2$ of $G$ is a planar convex greedy embedding if and only if, in the embedding $x$, weight of the maximum weight spanning tree ($T$) and weight of the minimum weight spanning tree ($\func{MST}$) satisfies $\WT(T)/\WT(\func{MST}) \leq (\card{V}-1)^{1 - δ}$, for some $0 < δ\leq 1$.

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

↑