69 search results - page 8 / 14 » Coloring Vertices and Faces of Locally Planar Graphs |
SIAMCOMP
2008
13 years 8 months ago
2008
We present a new algorithm to compute a subset S of vertices of a planar graph G whose removal partitions G into O(N/h) subgraphs of size O(h) and with boundary size O( h) each. ...
COMBINATORICA
2011
12 years 8 months ago
2011
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
GD
2006
Springer
14 years 7 days ago
2006
Springer
We consider graph drawing algorithms for learning spaces, a type of st-oriented partial cube derived from an antimatroid and used to model states of knowledge of students. We show...
AC
2003
Springer
14 years 1 months ago
2003
Springer
A completely automatic face recognition system is presented. The method works on color and gray level images: after having localized the face and the facial features, it determines...
INFOCOM
2008
IEEE
14 years 3 months ago
2008
IEEE
—Recently proposed beaconless georouting algorithms are fully reactive, with nodes forwarding packets without prior knowledge of their neighbors. However, existing approaches for...