270 search results - page 15 / 54 » Diameter bounds for planar graphs |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We show that for every connected graph G of diameter 3, the graph G3 has average degree 7 4 (G). We also provide an example showing that this bound is best possible. This resolv...
APPROX
2007
Springer
15 years 1 months ago
2007
Springer
We show that the multi-commodity max-flow/min-cut gap for series-parallel graphs can be as bad as 2, matching a recent upper bound [8] for this class, and resolving one side of a ...
IJCM
2002
14 years 9 months ago
2002
A minimum spanning tree (MST) with a small diameter is required in numerous practical situations. It is needed, for example, in distributed mutual exclusion algorithms in order to...
ICRA
2005
IEEE
15 years 3 months ago
2005
IEEE
— This paper presents a method for a planar rigid body consisting of multiple convex bodies to explore an unknown planar workspace, i.e., an unknown configuration space diffeomo...
CCCG
2010
14 years 11 months ago
2010
We consider two classes of higher order proximity graphs defined on a set of points in the plane, namely, the k-Delaunay graph and the k-Gabriel graph. We give bounds on the follo...