9 search results - page 1 / 2 » Extremal Graph Theory for Metric Dimension and Diameter |
ENDM
2007
13 years 5 months ago
2007
ARSCOM
2008
13 years 5 months ago
2008
Given a graph G, we say S V (G) is resolving if for each pair of distinct u, v V (G) there is a vertex x in S where d(u, x) = d(v, x). The metric dimension of G is the minimum c...
PODC
2004
ACM
13 years 11 months ago
2004
ACM
We consider the problem of designing a compact communication network that supports efficient routing in an Euclidean plane. Our network design and routing scheme achieves 1+ stret...
SIAMDM
2008
13 years 5 months ago
2008
From computational geometry comes the notion of a Gabriel graph of a point set in the plane. The Gabriel graph consists of those edges connecting two points of the point set such t...
PODC
2006
ACM
13 years 11 months ago
2006
ACM
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...