50 search results - page 3 / 10 » Partitions of Complete Geometric Graphs into Plane Trees |
STACS
2007
Springer
14 years 1 months ago
2007
Springer
An orthogonal spanner network for a given set of n points in the plane is a plane straight line graph with axis-aligned edges that connects all input points. We show that for any ...
ARSCOM
2007
13 years 7 months ago
2007
We partition the set of spanning trees contained in the complete graph Kn into spanning trees contained in the complete bipartite graph Ks,t. This relation will show that any prop...
GD
2009
Springer
14 years 3 days ago
2009
Springer
The geometric simultaneous embedding problem asks whether two planar graphs on the same set of vertices in the plane can be drawn using straight lines, such that each graph is pla...
DIS
2007
Springer
13 years 11 months ago
2007
Springer
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
DMTCS
2010
13 years 4 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...