π/2-Angle Yao Graphs are Spanners
نویسندگان
چکیده
We show that the Yao graph Y4 in the L2 metric is a spanner with stretch factor 8 √ 2(29 + 23 √ 2).
منابع مشابه
Odd Yao-Yao Graphs are Not Spanners
It is a long standing open problem whether Yao-Yao graphs YYk are all spanners [26]. Bauer and Damian [4] showed that all YY6k for k ≥ 6 are spanners. Li and Zhan [23] generalized their result and proved that all even Yao-Yao graphs YY2k are spanners (for k ≥ 42). However, their technique cannot be extended to odd Yao-Yao graphs, and whether they are spanners are still elusive. In this paper, w...
متن کاملAlmost All Even Yao-Yao Graphs Are Spanners
It is an open problem whether Yao-Yao graphs YYk (also known as sparse-Yao graphs) are all spanners when the integer parameter k is large enough. In this paper we show that, for any integer k ≥ 42, the Yao-Yao graph YY2k is a tk-spanner, with stretch factor tk = 6.03 +O(k −1) when k tends to infinity. Our result generalizes the best known result which asserts that all YY6k are spanners for k ≥ ...
متن کاملSome Properties of Yao Y4 Subgraphs
The Yao graph for k = 4, Y4, is naturally partitioned into four subgraphs, one per quadrant. We show that the subgraphs for one quadrant differ from the subgraphs for two adjacent quadrants in three properties: planarity, connectedness, and whether the directed graphs are spanners.
متن کاملFault-Tolerant Spanners in Networks with Symmetric Directional Antennas
Let P be a set of points in the plane, each equipped with a directional antenna that covers a sector of angle α and range r. In the symmetric model of communication, two antennas u and v can communicate to each other, if and only if v lies in u’s coverage area and vice versa. In this paper, we introduce the concept of fault-tolerant spanners for directional antennas, which enables us to constru...
متن کاملSpanning Properties of Theta-Theta Graphs
We study the spanning properties of Theta-Theta graphs. Similar in spirit with the Yao-Yao graphs, Theta-Theta graphs partition the space around each vertex into a set of k cones, for some fixed integer k > 1, and select at most one edge per cone. The difference is in the way edges are selected. Yao-Yao graphs select an edge of minimum length, whereas Theta-Theta graphs select an edge of minimu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Geometry Appl.
دوره 22 شماره
صفحات -
تاریخ انتشار 2012