On feasible and infeasible search for equitable graph coloring

An equitable legal k-coloring of an undirected graph G = (V, E) is a partition of the vertex set V into k disjoint independent sets, such that the cardinalities of any two independent sets differ by at most one (this is called the equity constraint). As a variant of the popular graph coloring problem (GCP), the equitable coloring problem (ECP) involves finding a minimum k for which an equitable legal k-coloring exists. In this paper, we present a study of searching both feasible and infeasible solutions with respect to the equity constraint. The resulting algorithm relies on a mixed search strategy exploring both equitable and inequitable colorings unlike existing algorithms where the search is limited to equitable colorings only. We present experimental results on 73 DIMACS and COLOR benchmark graphs and demonstrate the competitiveness of this search strategy by showing 9 improved best-known results (new upper bounds).

[1]  Alexandr V. Kostochka,et al.  On equitable Delta-coloring of graphs with low average degree , 2005, Theor. Comput. Sci..

[2]  Ko-Wei Lih,et al.  Equitable Coloring and the Maximum Degree , 1994, Eur. J. Comb..

[3]  Alain Hertz,et al.  Using tabu search techniques for graph coloring , 1987, Computing.

[4]  Wei Wang,et al.  Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs , 2014, Discret. Appl. Math..

[5]  Graciela L. Nasini,et al.  A DSATUR-based algorithm for the Equitable Coloring Problem , 2015, Comput. Oper. Res..

[6]  Fred W. Glover,et al.  The case for strategic oscillation , 2011, Ann. Oper. Res..

[7]  Jin-Kao Hao,et al.  Breakout Local Search for maximum clique problems , 2013, Comput. Oper. Res..

[8]  Klaus H. Ecker,et al.  Scheduling Computer and Manufacturing Processes , 2001 .

[9]  Graciela L. Nasini,et al.  A polyhedral approach for the equitable coloring problem , 2014, Discret. Appl. Math..

[10]  Jin-Kao Hao,et al.  Recent Advances in Graph Vertex Coloring , 2013, Handbook of Optimization.

[11]  Alexandr V. Kostochka,et al.  Equitable colorings of outerplanar graphs , 2002, Discret. Math..

[12]  Fred W. Glover,et al.  Backtracking based iterated tabu search for equitable coloring , 2015, Eng. Appl. Artif. Intell..

[13]  Marek Kubale,et al.  Sharp Bounds for the Complexity of Semi-Equitable Coloring of Cubic and Subcubic Graphs , 2016 .

[14]  Raymond Chiong,et al.  An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem , 2015, Appl. Soft Comput..

[15]  Ko-Wei Lih,et al.  On equitable coloring of bipartite graphs , 1996, Discret. Math..

[16]  Sandy Irani,et al.  Scheduling with conflicts, and applications to traffic signal control , 1996, SODA '96.

[17]  Graciela L. Nasini,et al.  A Tabu Search Heuristic for the Equitable Coloring Problem , 2014, ISCO.

[18]  Ko-Wei Lih,et al.  Equitable Coloring of Graphs , 1998 .

[19]  Fumio Kitagawa,et al.  An existential problem of a weight- controlled subset and its application to school timetable construction , 1988, Discret. Math..

[20]  Jin-Kao Hao,et al.  Hybrid Evolutionary Algorithms for Graph Coloring , 1999, J. Comb. Optim..

[21]  A. Tucker,et al.  Perfect Graphs and an Application to Optimizing Municipal Services , 1973 .

[22]  Fred W. Glover,et al.  A hybrid metaheuristic approach for the capacitated arc routing problem , 2016, Eur. J. Oper. Res..

[23]  Marek Kubale,et al.  The Complexity of Equitable Vertex Coloring of Graphs , 2005 .

[24]  A. V. Kostochkaa,et al.  On equitable -coloring of graphs with low average degree , 2005 .

[25]  Celso C. Ribeiro,et al.  A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives , 2014, Discret. Appl. Math..

[26]  Fedor V. Fomin,et al.  Equitable colorings of bounded treewidth graphs , 2005, Theor. Comput. Sci..