79 search results - page 7 / 16 » Planarity of iterated line graphs |
ICRA
2006
IEEE
14 years 3 months ago
2006
IEEE
- This paper introduces a new approach to identify singularities of planar parallel manipulators (PPMs). This method is based on Maxwell’s reciprocal figure theory which establis...
JGT
2008
13 years 9 months ago
2008
A homomorphism from an oriented graph G to an oriented graph H is a mapping from the set of vertices of G to the set of vertices of H such that ----(u)(v) is an arc in H whenever...
DISOPT
2008
13 years 10 months ago
2008
At present, the most successful approach to solving large-scale instances of the Symmetric Traveling Salesman Problem to optimality is branch-and-cut. The success of branch-and-cu...
JCT
2007
13 years 9 months ago
2007
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...
GD
2004
Springer
14 years 3 months ago
2004
Springer
We use Schnyder woods of 3-connected planar graphs to produce convex straight line drawings on a grid of size (n − 2 − ∆) × (n − 2 − ∆). The parameter ∆ ≥ 0 depen...