5 search results - page 1 / 1 » Geometric Spanners with Small Chromatic Number |
56
Voted
WAOA
2007
Springer
15 years 3 months ago
2007
Springer
FOCS
1994
IEEE
15 years 1 months ago
1994
IEEE
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 graph having the points of S as its vertices, such that for any pair p and q o...
COMGEO
1999
ACM
14 years 9 months ago
1999
ACM
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 graph having the points of S as its vertices, such that for any pair p and q o...
WADS
2007
Springer
15 years 3 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...
INFOCOM
2008
IEEE
15 years 3 months ago
2008
IEEE
—A large amount of algorithms has recently been designed for the Internet under the assumption that the distance defined by the round-trip delay (RTT) is a metric. Moreover, man...