Join Our Newsletter

12 search results - page 1 / 3» Number of Crossing-Free Geometric Graphs vs. Triangulations |

ENDM

2008

12 years 9 months ago
2008

We show that there is a constant > 0 such that, for any set P of n 5 points in general position in the plane, a crossing-free geometric graph on P that is chosen uniformly at...

CORR

2010

Springer

12 years 7 months ago
2010

Springer

We obtain new lower and upper bounds for the maximum multiplicity of some weighted and, respectively, non-weighted common geometric graphs drawn on n points in the plane in genera...

WG

2010

Springer

12 years 8 months ago
2010

Springer

Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...

GD

2006

Springer

13 years 1 months ago
2006

Springer

We give a brief account of results concerning the number of triangulations on finite point sets in the plane, both for arbitrary sets and for specific sets such as the n

DMTCS

2010

12 years 7 months ago
2010

A geometric graph is a graph G = (V, E) drawn in the plane, such that V is a point set in general position and E is a set of straight-line segments whose endpoints belong to V . W...