Given a weighted graph G=(V, E) and a real number t⩾ 1, a t-spanner of G is a spanning
subgraph G′ with the property that for every edge xy in G, there exists a path between x …

In this paper we show that the θ-graph with 4 cones has constant stretch factor, ie, there is a
path between any pair of vertices in this graph whose length is at most a constant times the …

Let ${\cal P} $ be a set of $ n $ points embedded in the plane, and let ${\cal C} $ be the
complete Euclidean graph whose point-set is ${\cal P} $. Each edge in ${\cal C} $ between …

Let EE be the complete Euclidean graph on a set of points embedded in the plane. Given a
constant t ≥ 1 t≥ 1, a spanning subgraph GG of EE is said to be at t-spanner, or simply a …

Motivated by the recent trend of increasing number of e-cars and hybrid cars, we investigate
the problem of building a red-black spanner for a mixed-charging vehicular network. In such …

The construction of bounded-degree plane geometric spanners has been a focus of interest
since 2002 when Bose, Gudmundsson, and Smid proposed the first algorithm to construct …

We look at generalized Delaunay graphs in the constrained setting by introducing line
segments which the edges of the graph are not allowed to cross. Given an arbitrary convex …

The construction of bounded-degree plane geometric spanners has been a focus of interest
in the field of geometric spanners for a long time. To date, several algorithms have been …

支撑图(spanner) 在无线(自主, 传感器) 网络拓扑控制中起着重要作用, 不但能保证最终的拓扑图
链路减少, 保持连通性, 而且保证任意一对通信节点之间所需费用是最少可能费用的常数因子倍 …

We establish an upper bound of 13+ 8 2≲ 4.931 on the stretch factor of the Yao graph Y 4∞
defined in the L∞-metric, improving upon the best previously known upper bound of 6.31 …