58 search results - page 12 / 12 » Distance Oracles for Sparse Graphs |
181
Voted
ICALP
2011
Springer
14 years 9 months ago
2011
Springer
We present an O( √ n log n)-approximation algorithm for the problem of finding the sparsest spanner of a given directed graph G on n vertices. A spanner of a graph is a sparse ...
167
Voted
WDAG
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two no...
158
Voted
INFOCOM
2006
IEEE
15 years 12 months ago
2006
IEEE
— In the standard approach to studying connectivity, a physical layer is assumed that allows direct transmission between neighbors within some fixed distance. The graph resultin...