Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,699,313 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
17 relations
Beta skeleton
Computational geometry
Degree (graph theory)
Delaunay triangulation
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
A Novel Algorithm for the All-Best-Swap-Edge Problem on Tree Spanners
Davide Bilò
,
Kleitos Papadopoulos
International Symposium on Algorithms and…
2018
Corpus ID: 49562686
Given a 2-edge connected, unweighted, and undirected graph $G$ with $n$ vertices and $m$ edges, a $\sigma$-tree spanner is a…
Expand
2018
2018
Diameter Spanner, Eccentricity Spanner, and Approximating Extremal Graph Distances: Static, Dynamic, and Fault Tolerant
Keerti Choudhary
,
Omer Gold
arXiv.org
2018
Corpus ID: 54444910
The diameter, vertex eccentricities, and the radius of a graph are some of the most fundamental graph parameters. Roditty and…
Expand
2017
2017
Optimal Orientation of Symmetric Directional Antennas on a Line
AmirMahdi Ahmadinejad
,
F. Baharifard
,
Khadijeh Sheikhan
,
H. Zarrabi-Zadeh
Canadian Conference on Computational Geometry
2017
Corpus ID: 6249201
In this paper, we study the problem of optimal orientation of directional antennas on a line in the symmetric model of…
Expand
2016
2016
Visualization of Geometric Spanner Algorithms
M. Farshi
,
S. Hosseini
International Symposium on Computational Geometry
2016
Corpus ID: 8522238
It is easier to understand an algorithm when it can be seen in interactive mode. The current study implemented four algorithms to…
Expand
2011
2011
Efficient Geometric Algorithms for Wireless Networks
Swaminathan Sankararaman
2011
Corpus ID: 26787544
. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 12 CHAPTER
2010
2010
Improved local algorithms for spanner construction
Iyad A. Kanj
,
Ge Xia
Theoretical Computer Science
2010
Corpus ID: 14069488
2009
2009
Geodesic Spanners on Polyhedral Surfaces
S. Kapoor
,
Xiangyang Li
International Symposium on Algorithms and…
2009
Corpus ID: 16257847
In this paper we consider the problem of efficiently constructing geodesic t-spanners. We consider finding sparse spanners on the…
Expand
2008
2008
Applications of Geometric Spanner Networks
Joachim Gudmundsson
,
G. Narasimhan
,
M. Smid
Encyclopedia of Algorithms
2008
Corpus ID: 26871
Given a geometric graph in d-dimensional space, it is useful to preprocess it so that distance queries, exact or approximate, can…
Expand
2008
2008
Anchor bar cap nut loosening and tightening spanner
孙位彬
2008
Corpus ID: 135294294
An anchor bar cap nut loosening and tightening spanner comprises an anchor bar cap nut sleeve 1, an anchor bar tail sleeve 2, a…
Expand
2004
2004
Lower bounds for graph embeddings and combinatorial preconditioners
G. Miller
,
Peter C. Richter
ACM Symposium on Parallelism in Algorithms and…
2004
Corpus ID: 8428806
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…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE