On edge orienting methods for graph coloring
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 orienting problem is equivalent to finding the chromatic number of a graph. We study various properties of edge orienting methods in the context of local search for graph coloring. We then exploit these properties to derive four tabu search algorithms, each based on a different neighborhood. We compare these algorithms numerically to determine which are the most promising and to give potential research directions.
KeywordsGraph coloring Local search Edge orienting
Unable to display preview. Download preview PDF.
- Ahuja RK, Magnanti TL, Orlin JB (1993) Network flows: theory, algorithms, and applications. Prentice-Hall, New Jersey, pp 107–108Google Scholar
- Galinier P, Hertz A (2006) A survey of local search methods for graph coloring. Comput & Oper Res (to appear)Google Scholar
- Gallai T (1968) On directed paths and circuits. In: Erdös P, Katobna G (eds) Theory of graphs. Academic Press, Tihany, New York, pp 115–118Google Scholar
- Glover F, Laguna M (eds) (1997) Tabu search. Kluwer Academic PublishersGoogle Scholar
- Johnson DS, Trick MA (1996) Proceedings of the 2nd DIMACS implementation challenge, DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26, American Mathematical SocietyGoogle Scholar
- Roy B (1967) Nombre chromatique et plus longs chemins d’un graphe. Revue AFIRO 1:127–132Google Scholar
- Vitaver LM (1962) Determination of minimal coloring of vertices of a graph by means of Boolean powers of the incidence matrix. Dokl Akad Nauk SSSR147 758–759 (in Russian)Google Scholar