736 search results - page 29 / 148 » Distinguishing geometric graphs |
128
Voted
CCCG
2010
15 years 3 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...
110
Voted
SIAMCOMP
2002
15 years 1 months ago
2002
Given a set V of n points in Rd and a real constant t > 1, we present the first O(n log n)-time algorithm to compute a geometric t-spanner on V . A geometric t-spanner on V is a...
132
Voted
ALGOSENSORS
2004
Springer
15 years 7 months ago
2004
Springer
We conjecture that any planar 3-connected graph can be embedded in the plane in such a way that for any nodes s and t, there is a path from s to t such that the Euclidean distance ...
COMGEO
2004
ACM
15 years 1 months ago
2004
ACM
Let
JGT
2007
15 years 1 months ago
2007
We are interested in the relation between the pathwidth of a biconnected outerplanar graph and the pathwidth of its (geometric) dual. Bodlaender and Fomin [3], after having proved...