Skip to search formSkip to main contentSkip to account menu

Geometric spanner

A geometric spanner or a t-spanner graph or a t-spanner was initially introduced as a weighted graph over a set of points as its vertices for which… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Given a 2-edge connected, unweighted, and undirected graph $G$ with $n$ vertices and $m$ edges, a $\sigma$-tree spanner is a… 
2018
2018
The diameter, vertex eccentricities, and the radius of a graph are some of the most fundamental graph parameters. Roditty and… 
2017
2017
In this paper, we study the problem of optimal orientation of directional antennas on a line in the symmetric model of… 
2016
2016
It is easier to understand an algorithm when it can be seen in interactive mode. The current study implemented four algorithms to… 
2011
2011
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 CHAPTER 
2009
2009
In this paper we consider the problem of efficiently constructing geodesic t-spanners. We consider finding sparse spanners on the… 
2008
2008
Given a geometric graph in d-dimensional space, it is useful to preprocess it so that distance queries, exact or approximate, can… 
2008
2008
An anchor bar cap nut loosening and tightening spanner comprises an anchor bar cap nut sleeve 1, an anchor bar tail sleeve 2, a… 
2004
2004
Given a general graph <i>G</i>, a fundamental problem is to find a spanning tree <i>H</i> that best approximates <i>G</i> by some…