736 search results - page 16 / 148 » Distinguishing geometric graphs |
100
click to vote
GD
2004
Springer
15 years 5 months ago
2004
Springer
Pinchasi and Radoiˇci´c [11] used the following observation to bound the number of edges of a topological graph without a self-crossing cycle of length 4: if we make a list of t...
106
click to vote
COMPGEOM
2005
ACM
15 years 1 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
SAC
2006
ACM
15 years 5 months ago
2006
ACM
We propose a geometric constraint solving method based on connectivity analysis in graph theory, which can be used to decompose a well-constrained problem into some smaller ones i...
COMGEO
2008
ACM
14 years 12 months ago
2008
ACM
Let G be a connected plane geometric graph with n vertices. In this paper, we study bounds on the number of edges required to be added to G to obtain 2-vertex or 2-edge connected ...
105
click to vote
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We consider the problem of constructing bounded-degree planar geometric spanners of Euclidean and unit-disk graphs. It is well known that the Delaunay subgraph is a planar geometri...