An Incremental SAT-Based Approach for Graph Colouring Problem - Université Côte d'Azur
Communication Dans Un Congrès Année : 2019

An Incremental SAT-Based Approach for Graph Colouring Problem

Fichier non déposé

Dates et versions

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

Identifiants

  • HAL Id : hal-02271397 , version 1

Citer

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⟩
119 Consultations
0 Téléchargements

Partager

More