Polyhedral studies on vertex coloring problems
Many variants of the vertex coloring problem have been de ned, such as precoloring extension, μ-coloring, (γ ; μ)-coloring, and list coloring. These problems are NP-hard, as they generalize the classical vertex coloring problem. On the other side, there exist several families of graphs for which som...
Guardado en:
| Autores principales: | Delle Donne, Diego, Marenco, Javier |
|---|---|
| Formato: | Objeto de conferencia Resumen |
| Lenguaje: | Español |
| Publicado: |
2013
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/94550 |
| Aporte de: |
Ejemplares similares
-
Polyhedral studies of vertex coloring problems: The standard formulation
por: Delle Donne, Diego, et al.
Publicado: (2016) -
Polyhedral studies of vertex coloring problems: The standard formulation
por: Delle Donne, D., et al. -
A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
por: Delle Donne, Diego, et al.
Publicado: (2011) -
A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
por: Delle Donne, D., et al.
Publicado: (2011) -
A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
por: Delle Donne, D., et al.
Publicado: (2011)