Abstract
Graph coloring is a major component of numerous allocation and scheduling problems.
We introduce a hybrid CP/SAT approach to graph coloring based on exploring Zykov’s tree: for two non-neighbors, either they take a different color and there might as well be an edge between them, or they take the same color and we might as well merge them. Branching on whether two neighbors get the same color yields a symmetry-free tree with complete graphs as leaves, which correspond to colorings of the original graph.
We introduce a new lower bound for this problem based on Mycielskian graphs; a method to produce a clausal explanation of this bound for use in a CDCL algorithm; and a branching heuristic emulating Brelaz on the Zykov tree.
The combination of these techniques in both a branch-and-bound and in a bottom-up search outperforms Dsatur and other SAT-based approaches on standard benchmarks both for finding upper bounds and for proving lower bounds.
G. Katsirelos—Partially supported by the french “Agence nationale de la Recherche”, project DEMOGRAPH, reference ANR-16-C40-0028.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsNotes
- 1.
We abuse the neighborhood notation and write \(N({S})\) for \(\bigcup _{u \in S}N({u})\).
- 2.
We assume the graph is connected, otherwise \(u \) may not always exist.
- 3.
Sources available at: https://bitbucket.org/gkatsi/minicsp.
- 4.
Sources available at: https://bitbucket.org/gkatsi/gc-cdcl/src/master/.
- 5.
cdcl exceeded the memory limit on 4 instances, and CPLEX on 16 instances.
References
Aardal, K.I., Van Hoesel, S.P.M., Koster, A.M.C.A., Mannino, C., Sassano, A.: Models and solution techniques for frequency assignment problems. Ann. Oper. Res. 153(1), 79–129 (2007)
Brélaz, D.: New methods to color the vertices of a graph. Commun. ACM 22(4), 251–256 (1979)
Chaitin, G.J., Auslander, M.A., Chandra, A.K., Cocke, J., Hopkins, M.E., Markstein, P.W.: Register allocation via coloring. Comput. Lang. 6(1), 47–57 (1981)
De Cat, B., Denecker, M., Bruynooghe, M., Stuckey, P.: Lazy model expansion: interleaving grounding with search. J. Artif. Intell. Res. 52, 235–286 (2015)
Eppstein, D., Löffler, M., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. ACM J. Exp. Algorithmics 18(3.1–3.21) (2013)
Frost, D., Dechter, R.: Look-ahead value ordering for constraint satisfaction problems. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence (IJCAI-1995), pp. 572–578 (1995)
Gomes, C., Selman, B., Kautz, H.: Boosting combinatorial search through randomization. In: Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-1998), pp. 431–438 (1998)
Huang, J.: The effect of restarts on the efficiency of clause learning. In: Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI-2007) (2007)
Jiang, H., Li, C.-M., Manyà, F.: An exact algorithm for the maximum weight clique problem in large graphs. In: Proceedings of the 31st Conference on Artificial Intelligence (AAAI-2017), pp. 830–838 (2017)
Katsirelos, G., Bacchus, F.: Generalized nogoods in CSPs. In: Proceedings of the 20th National Conference on Artificial Intelligence (AAAI-2005), pp. 390–396 (2005)
Lick, D.R., White, A.T.: k-degenerate graphs. Can. J. Math. 22, 1082–1096 (1970)
Lin, J., Cai, S., Luo, C., Su, K.: A reduction based method for coloring very large graphs. In: Proceedings of the 26th International Joint Conference on Artificial Intelligence (IJCAI-2017), pp. 517–523 (2017)
Marques-Silva, J.P., Sakallah, K.A.: GRASP–a search algorithm for propositional satisfiability. IEEE Trans. Comput. 48(5), 506–521 (1999)
Mehrotra, A., Trick, M.A.: A column generation approach for graph coloring. INFORMS J. Comput. 8(4), 344–354 (1996)
Moskewicz, M., Madigan, C., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: Proceedings of the 39th Design Automation Conference (DAC-2001), pp. 530–535 (2001)
Mycielski, J.: Sur le coloriage des graphes. Colloq. Math 3, 161–162 (1955)
Ohrimenko, O., Stuckey, P.J., Codish, M.: Propagation = lazy clause generation. In: Bessière, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 544–558. Springer, Heidelberg (2007). https://doi.org/10.1007/978-3-540-74970-7_39
Park, T., Lee, C.Y.: Application of the graph coloring algorithm to the frequency assignment problem. J. Oper. Res. Soc. Jpn. 39(2), 258–265 (1996)
Schaafsma, B., Heule, M.J.H., van Maaren, H.: Dynamic symmetry breaking by simulating zykov contraction. In: Kullmann, O. (ed.) SAT 2009. LNCS, vol. 5584, pp. 223–236. Springer, Heidelberg (2009). https://doi.org/10.1007/978-3-642-02777-2_22
Stergiou, K.: Heuristics for dynamically adapting propagation. In: Proceedings of the 18th European Conference on Artificial Intelligence (ECAI-2008), pp. 485–489 (2008)
Trick, M.A. (ed.): Computational Symposium on Graph Coloring and its Generalizations (COLOR-2002) (2002)
Van Gelder, A.: Another look at graph coloring via propositional satisfiability. Discrete Appl. Math. 156(2), 230–243 (2008)
Van Hentenryck, P., Ågren, M., Flener, P., Pearson, J.: Tractable symmetry breaking for CSPs with interchangeable values. In: Proceedings of the 18th International Joint Conference on Artificial Intelligence (IJCAI-2003), pp. 277–282 (2003)
Walsh, T.: Breaking value symmetry. In: Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI-2008), pp. 880–887 (2008)
Zhou, Z., Li, C.-M., Huang, C., Ruchu, X.: An exact algorithm with learning for the graph coloring problem. Comput. Oper. Res. 51, 282–301 (2014)
Zykov, A.A.: On some properties of linear complexes. Mat. Sb. (N.S.) 24(66)(2), 163–188 (1949). http://mi.mathnet.ru/eng/msb5974
Author information
Authors and Affiliations
Corresponding authors
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Hebrard, E., Katsirelos, G. (2018). Clause Learning and New Bounds for Graph Coloring. In: Hooker, J. (eds) Principles and Practice of Constraint Programming. CP 2018. Lecture Notes in Computer Science(), vol 11008. Springer, Cham. https://doi.org/10.1007/978-3-319-98334-9_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-98334-9_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-98333-2
Online ISBN: 978-3-319-98334-9
eBook Packages: Computer ScienceComputer Science (R0)