An Incremental SAT-Based Approach for Graph Colouring Problem - Université Côte d'Azur Access content directly
Conference Papers Year : 2019
No file

Dates and versions

hal-02271397 , version 1 (26-08-2019)

Identifiers

  • HAL Id : hal-02271397 , version 1

Cite

Gael Glorian, Jean-Marie Lagniez, Valentin Montmirail, Nicolas Szczepanski. An Incremental SAT-Based Approach for Graph Colouring Problem. The 25th International Conference on Principles and Practice of Constraint Programming (CP'19), Sep 2019, Stamford, CT, United States. ⟨hal-02271397⟩
117 View
0 Download

Share

Gmail Mastodon Facebook X LinkedIn More