Wen Sun
ABSTRACT
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).
- Laura Bahiense, Yuri Frota, Thiago F. Noronha, and Celso C. Ribeiro. A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives. Discrete Applied Mathematics 164, (2014), 34--46. Google Scholar
Digital Library
- Una Benlic and Jin-Kao Hao. Breakout local search for maximum clique problems. Computers and Operations Research 40, 1 (2013), 192--206. Google ScholarDigital Library
- Jacek Blazewicz, Klaus H. Ecker, Erwin Pesch, Günter Schmidt, and Jan Weglarz. Scheduling computer and manufacturing processes. Journal of the Operational Research Society 48, 6 (1997), 659--659.Google ScholarCross Ref
- Hans L. Bodlaender and Fedor V. Fomin. Equitable colorings of bounded treewidth graphs. In International Symposium on Mathematical Foundations of Computer Science. Springer, (2004), 180--190.Google Scholar
- Yuning Chen, Jin-Kao Hao, and Fred Glover. A hybrid metaheuristic approach for the capacitated arc routing problem. European Journal of Operational Research 253, 1 (2016), 25--39.Google ScholarCross Ref
- Bor-Liang Chen, Ko-Wei Lih, and Pou-Lin Wu. Equitable coloring and the maximum degree. European Journal of Combinatorics 15, 5 (1994), 443--447. Google ScholarDigital Library
- Jian-Ya Ding, Shi-ji Song, Jatinder N.D. Gupta, Rui Zhang, Raymond Chiong, and Cheng Wu. An improved iterated greedy algorithm with a Tabu-based reconstruction strategy for the no-wait flowshop scheduling problem. Applied Soft Computing 30, (2015), 604--613. Google ScholarDigital Library
- Hanna Furmańczyk and Marek Kubale. Equitable coloring of graphs. Contemporary Mathematics 352, (2004), 35--54.Google ScholarCross Ref
- Hanna Furmańczyk and Marek Kubale. The complexity of equitable vertex coloring of graphs. Journal of Applied Computer Science 13, 2 (2005), 95--106.Google Scholar
- Philippe Galinier and Jin-Kao Hao. Hybrid evolutionary algorithms for graph coloring. Journal of Combinatioal Optimization 3, 4 (1999), 379--397.Google ScholarCross Ref
- Philippe Galinier, Jean-Philippe Hamiez, Jin-Kao Hao, and Daniel Porumbel. Recent advances in graph vertex coloring. In Zelinka I., Abraham A., Snasel V. (Eds.) Handbook of Optimization, Springer (2012).Google Scholar
- Fred Glover and Jin-Kao Hao. The case for strategic oscillation. Annals of Operations Research 183, 1 (2011), 163--173.Google ScholarCross Ref
- Fred Glover and Manuel Laguna. Tabu Search. Springer. (1997). Google ScholarDigital Library
- Alain Hertz and Dominique de Werra. Using tabu search techniques for graph coloring. Computing 39, 4 (1987), 345--351. Google ScholarDigital Library
- Sandy Irani and Vitus Leung. Scheduling with conflicts, and applications to traffic signal control. In Symposium on Discrete Algorithms, 96, (1996), 85--94. Google ScholarDigital Library
- Fumio Kitagawa and Hideto Ikeda. An existential problem of a weightcontrolled subset and its application to school timetable construction. Annals of Discrete Mathematics 38, (1988), 195--211. Google ScholarDigital Library
- Alexandr V Kostochka. Equitable colorings of outerplanar graphs. Discrete Mathematics 258, 1 (2002), 373--377.Google ScholarCross Ref
- Alexandr V Kostochka and Kittikorn Nakprasit. On equitable Δ-coloring of graphs with low average degree. Theoretical Computer Science 349, 1 (2005), 82--91. Google ScholarDigital Library
- Xiangjing Lai, Jin-Kao Hao, and Fred Glover. Backtracking based iterated tabu search for equitable coloring. Engineering Applications of Artificial Intelligence 46, (2015), 269--278. Google ScholarDigital Library
- Ko-Wei Lih and Pou-Lin Wu. On equitable coloring of bipartite graphs. Discrete Mathematics 151, 1 (1996), 155--160. Google ScholarDigital Library
- Isabel Méndez Díaz, Graciela Nasini, and Daniel Severín. A tabu search heuristic for the equitable coloring problem. In International Symposium on Combinatorial Optimization. Springer, (2014). 347--358.Google ScholarCross Ref
- Isabel Méndez-Díaz, Graciela Nasini, and Daniel Severín. A polyhedral approach for the equitable coloring problem. Discrete Applied Mathematics 164, (2014), 413--426. Google ScholarDigital Library
- Isabel Méndez-Díaz, Graciela Nasini, and Daniel Severín. A DSATUR-based algorithm for the Equitable Coloring Problem. Computers & Operations Research 57, (2015), 41--50. Google ScholarDigital Library
- Walter Meyer. Equitable coloring. The American Mathematical Monthly 80, 8 (1973), 920--922.Google ScholarCross Ref
- Alan Tucker. 1973. Perfect graphs and an application to optimizing municipal services. Siam Review 15, 3 (1973), 585--590. Google ScholarDigital Library
- Zhidan Yan and Wei Wang. Equitable coloring of Kronecker products of complete multipartite graphs and complete graphs. Discrete Applied Mathematics 162, (2014), 328--333.Google ScholarDigital Library
Recommendations
Backtracking based iterated tabu search for equitable coloring
An equitable k-coloring of an undirected graph G = ( V , E ) is a partition of its vertices into k disjoint independent sets, such that the cardinalities of any two independent sets differ by at most one. As a variant of the graph coloring problem (GCP),...
Equitable Δ-coloring of graphs
Consider a graph G consisting of a vertex set V(G) and an edge set E(G). Let @D(G) and @g(G) denote the maximum degree and the chromatic number of G, respectively. We say that G is equitably @D(G)-colorable if there exists a proper @D(G)-coloring of G ...
On equitable Δ-coloring of graphs with low average degree
Graph coloringsAn equitable coloring of a graph is a proper vertex coloring such that the sizes of any two color classes differ by at most 1. Hajnal and Szemerédi proved that every graph with maximum degree Δ is equitably k-colorable for every k ≥ Δ + 1. Chen, Lih, ...
Comments