270 search results - page 10 / 54 » Diameter bounds for planar graphs |
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
The Fermat-Weber center of a planar body Q is a point in the plane from which the average distance to the points in Q is minimal. We first show that for any convex body Q in the ...
DM
2008
13 years 9 months ago
2008
The coefficient of fragmentability of a class of graphs measures the proportion of vertices that need to be removed from the graphs in the class in order to leave behind bounded s...
WADS
2005
Springer
14 years 3 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
APPROX
2004
Springer
14 years 3 months ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
JNW
2008
13 years 9 months ago
2008
Abstract-- We study the communication primitive of broadcasting (one-to-all communication) in known topology radio networks, i.e., where for each primitive the schedule of transmis...