1363 search results - page 53 / 273 » The road coloring problem |
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
Many researchers are working on various aspects of color imaging. However, it is apparent from the papers published that it is difficult for many of them to produce high quality c...
106
click to vote
COCOON
2005
Springer
15 years 3 months ago
2005
Springer
For a bounded integer , we wish to color all edges of a graph G so that any two edges within distance have different colors. Such a coloring is called a distance-edge-coloring or ...
ESA
2004
Springer
15 years 3 months ago
2004
Springer
We show the first o(n2 ) algorithm for coloring vertices of trianglefree planar graphs using three colors. The time complexity of the algorithm is O(n log n). Our approach can be ...
EVOW
2001
Springer
15 years 2 months ago
2001
Springer
This paper presents a new heuristic algorithm for the graph coloring problem based on a combination of genetic algorithms and simulated annealing. Our algorithm exploits a novel cr...
APPROX
2011
Springer
13 years 9 months ago
2011
Springer
How to color 3 colorable graphs with few colors is a problem of longstanding interest. The best polynomial-time algorithm uses n0.2072 colors. There are no indications that colori...