25 search results - page 2 / 5 » Sparse Additive Spanners for Bounded Tree-Length Graphs |
79
Voted
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
We consider the problem of efficiently finding an additive C-spanner of an undirected unweighted graph G, that is, a subgraph H so that for all pairs of vertices u, v, δH (u, v) ...
ICALP
2007
Springer
15 years 5 months ago
2007
Springer
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
110
Voted
COMGEO
2007
ACM
14 years 11 months ago
2007
ACM
In this paper we investigate the relations between spanners, weak spanners, and power spanners in RD for any dimension D and apply our results to topology control in wireless netw...
IPPS
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper, we propose a new distributed algorithm that constructs a sparse spanner subgraph of the unit disk graph efficiently for wireless ad hoc networks. It maintains a li...
113
Voted
WADS
2007
Springer
15 years 5 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...