1363 search results - page 80 / 273 » The road coloring problem |
SIAMDM
2008
14 years 11 months ago
2008
We show that every triangle-free graph on the double torus is 4-colorable. This settles a problem raised by Gimbel and Thomassen [Trans. Amer. Math. Soc. 349 (1997), 4555
113
click to vote
EGITALY
2006
15 years 1 months ago
2006
Palette re-ordering is a well known and very effective approach for improving the compression of color-indexed images. If the spatial distribution of the indexes in the image is s...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We consider the discrepancy problem of coloring n intervals with k colors such that at each point on the line, the maximal difference between the number of intervals of any two co...
107
click to vote
EOR
2008
14 years 12 months ago
2008
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
JCO
2007
14 years 11 months ago
2007
We consider the problem of orienting the edges of a graph so that the length of a longest path in the resulting digraph is minimum. As shown by Gallai, Roy and Vitaver, this edge ...