69 search results - page 10 / 14 » Coloring Vertices and Faces of Locally Planar Graphs |
SIAMDM
2010
13 years 3 months ago
2010
The following problem was introduced by Marcin Krzywkowski as a generalization of a problem of Todd Ebert. After initially coordinating a strategy, n players each occupy a differe...
DAC
1998
ACM
14 years 9 months ago
1998
ACM
We have developed a new algorithm and software for graph coloring by systematically combining several algorithm and software development ideas that had crucial impact on the algor...
DCG
2011
13 years 3 months ago
2011
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by O(27.55n ) = O(18...
ICPR
2010
IEEE
13 years 5 months ago
2010
IEEE
We present a method for object tracking over time sequence imagery. The image plane is represented with a 4-connected planar graph where vertices are associated with pixels. On ea...
PR
2006
13 years 8 months ago
2006
In this paper a completely automatic face recognition system is presented. The method works on color images: after having localized the face and the facial features, it determines...