736 search results - page 10 / 148 » Distinguishing geometric graphs |
106
click to vote
FAW
2009
Springer
15 years 6 months ago
2009
Springer
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
108
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
Geometric routing algorithms like GFG (GPSR) are lightweight, scalable algorithms that can be used to route in resource-constrained ad hoc wireless networks. However, such algorith...
WEA
2009
Springer
15 years 6 months ago
2009
Springer
What does it mean for two geometric graphs to be similar? We propose a distance for geometric graphs that we show to be a metric, and that can be computed by solving an integer li...
116
click to vote
WADS
2007
Springer
15 years 5 months ago
2007
Springer
We introduce a family of directed geometric graphs, denoted Gθ λ, that depend on two parameters λ and θ. For 0 ≤ θ < π 2 and 1 2 < λ < 1, the Gθ λ graph is a s...
WAW
2004
Springer
15 years 5 months ago
2004
Springer
We study a random graph Gn that combines certain aspects of geometric random graphs and preferential attachment graphs. The vertices of Gn are n sequentially generated points x1, ...