736 search results - page 8 / 148 » Distinguishing geometric graphs |
SODA
2012
ACM
11 years 11 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
GC
2007
Springer
13 years 8 months ago
2007
Springer
We develop Gray code enumeration schemes for geometric graphs in the plane. The considered graph classes include plane straight-line graphs, plane spanning trees, and connected pl...
VMV
2001
13 years 9 months ago
2001
A new approach to subdivision based on the evolution of surfaces under curvature motion is presented. Such an evolution can be understood as a natural geometric filter process whe...
DMTCS
2010
13 years 5 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...
WADS
2007
Springer
14 years 2 months ago
2007
Springer
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...