1363 search results - page 114 / 273 » The road coloring problem |
117
click to vote
CN
2007
14 years 12 months ago
2007
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Let G = (V, E) be a graph. Let c : V → N be a vertex-coloring of the vertices of G. For any vertex u, we denote by N[u] its closed neighborhood (u and its adjacent vertices), an...
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
In the context of object recognition, it is useful to extract, from the images, efficient indexes that are insensitive to the illumination conditions, to the camera scale factor ...
FGR
2004
IEEE
15 years 3 months ago
2004
IEEE
We present a lip contour extraction method using separability of color intensity distributions. Usually it is difficult to robustly extract the outer lip contour mainly because of...
JGAA
2006
14 years 12 months ago
2006
We consider two problems, namely Min Split-coloring and Min Cocoloring, that generalize the classical Min Coloring problem by using not only stable sets but also cliques to cover ...