50 search results - page 6 / 10 » Spanners for Geometric Intersection Graphs |
116
Voted
WG
2007
Springer
15 years 9 months ago
2007
Springer
176
Voted
WG
2010
Springer
15 years 1 months ago
2010
Springer
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
147
Voted
IM
2008
15 years 3 months ago
2008
Let G = G(n, r) be a random geometric graph resulting from placing n nodes uniformly at random in the unit square (disk) and connecting every two nodes if and only if their Euclide...
137
Voted
SIROCCO
2001
15 years 5 months ago
2001
We consider online routing algorithms for finding paths between the vertices of plane graphs. Although it has been shown in Bose et al. [4] that there exists no competitive routin...
184
Voted
WG
2004
Springer
15 years 9 months ago
2004
Springer
A unit disk graph is the intersection graph of unit disks in the euclidean plane. We present a polynomial-time approximation scheme for the maximum weight independent set problem i...