arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1207.4082cs.CGcs.DM
收藏

关于局部Gabriel几何图

On Locally Gabriel Geometric Graphs

Sathish Govindarajan, Abhijeet Khopkar

摘要:

设$P$是平面中的一组$n$点。如果对于$G$中的每条边$(u,v)$,以$u$和$v$为直径的圆盘不包含$P$中任何与$G$中的$u$或$v$相邻的点,则称$G$上的几何图$G$为{ \it localized Gabriel}。局部Gabriel图是Gabriel图的一种推广,它是由在无线网络中的应用而产生的。与Gabriel图不同,在给定的点集上不存在唯一的局部Gabriel图,因为在局部Gabriel图中不一定包含或排除边。因此,可以定制图的边集,以根据应用优化某些网络参数。本文给出了局部Gabriel图的边复杂度和独立集的组合界:(i)对任何$n$,存在具有$Ω(n^{5/4})$边的局部Gabriel图.这改进了$Ω(n^{1+\frac{1}{\log \log n}})$的先前最佳界限。(ii)对于凸点集的各种子类,我们证明了局部Gabriel图的最大边复杂度的线性界。(iii)对于任意$n$点集上的局部Gabriel图,存在一个大小为$Ω(\sqrt{n}\log n)$的独立点集.

英文摘要:

Let $P$ be a set of $n$ points in the plane. A geometric graph $G$ on $P$ is said to be {\it locally Gabriel} if for every edge $(u,v)$ in $G$, the disk with $u$ and $v$ as diameter does not contain any points of $P$ that are neighbors of $u$ or $v$ in $G$. A locally Gabriel graph is a generalization of Gabriel graph and is motivated by applications in wireless networks. Unlike a Gabriel graph, there is no unique locally Gabriel graph on a given point set since no edge in a locally Gabriel graph is necessarily included or excluded. Thus the edge set of the graph can be customized to optimize certain network parameters depending on the application. In this paper, we show the following combinatorial bounds on edge complexity and independent sets of locally Gabriel graphs: (i) For any $n$, there exists locally Gabriel graphs with $Ω(n^{5/4})$ edges. This improves upon the previous best bound of $Ω(n^{1+\frac{1}{\log \log n}})$. (ii) For various subclasses of convex point sets, we show tight linear bounds on the maximum edge complexity of locally Gabriel graphs. (iii) For any locally Gabriel graph on any $n$ point set, there exists an independent set of size $Ω(\sqrt{n}\log n)$.

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

↑