Given a set of n points TeX in the plane and a real value t>1 we show how to construct in time TeX a t-spanner TeX of TeX such that there exists a set of vertices TeX of size TeX whose removal leaves two disconnected sets TeX and TeX where neither is of size greater than 2/3 · n. The spanner also has some additional properties; low weight and constant degree
A spanner graph on a set of points in Rd provides shortest paths between any pair of points with len...
Let G = (V,E) be an undirected weighted graph on |V | = n vertices and |E| = m edges. A t-spanner of...
Given a connected graph G = (V; E) with n vertices and m edges, the distance between two vertices in...
Given a set of n points TeX in the plane and a real value t>1 we show how to construct in time Te...
Given a set S of n points in the plane, we give an O(n log n)-time algorithm that constructs a plane...
Abstract. Given a set V of n points in R d and a real constant t> 1, we present the first O(n log...
AbstractA t-spanner of a graph G is its spanning subgraph S such that the distance between every pai...
AbstractFor a set S of points in Rd, an s-spanner is a subgraph of the complete graph with node set ...
For a set S of points in Rd, an s-spanner is a subgraph of the complete graph with node set S such t...
Let $S$ be a set of $n$ points in $\IR^d$ and let $t>1$ be a real number. A $t$-spanner for $S$ is a...
For a set S of points in R d,ans-spanner is a graph on S such that any pair of points is connected v...
The greedy t-spanner of a set of points in the plane is an undirected graph constructed by consideri...
A t-spanner of a graph G is a spanning subgraph H such that the distance between any two vertices in...
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed gr...
ABSTRACT: A t-spanner of an undirected, unweighted graph G is a spanning subgraph S of G with the ad...
A spanner graph on a set of points in Rd provides shortest paths between any pair of points with len...
Let G = (V,E) be an undirected weighted graph on |V | = n vertices and |E| = m edges. A t-spanner of...
Given a connected graph G = (V; E) with n vertices and m edges, the distance between two vertices in...
Given a set of n points TeX in the plane and a real value t>1 we show how to construct in time Te...
Given a set S of n points in the plane, we give an O(n log n)-time algorithm that constructs a plane...
Abstract. Given a set V of n points in R d and a real constant t> 1, we present the first O(n log...
AbstractA t-spanner of a graph G is its spanning subgraph S such that the distance between every pai...
AbstractFor a set S of points in Rd, an s-spanner is a subgraph of the complete graph with node set ...
For a set S of points in Rd, an s-spanner is a subgraph of the complete graph with node set S such t...
Let $S$ be a set of $n$ points in $\IR^d$ and let $t>1$ be a real number. A $t$-spanner for $S$ is a...
For a set S of points in R d,ans-spanner is a graph on S such that any pair of points is connected v...
The greedy t-spanner of a set of points in the plane is an undirected graph constructed by consideri...
A t-spanner of a graph G is a spanning subgraph H such that the distance between any two vertices in...
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed gr...
ABSTRACT: A t-spanner of an undirected, unweighted graph G is a spanning subgraph S of G with the ad...
A spanner graph on a set of points in Rd provides shortest paths between any pair of points with len...
Let G = (V,E) be an undirected weighted graph on |V | = n vertices and |E| = m edges. A t-spanner of...
Given a connected graph G = (V; E) with n vertices and m edges, the distance between two vertices in...
DOI
Add to ORKG