An exact algorithm for the edge coloring by total labeling problem
This paper addresses the edge coloring by total labeling graph problem. This is a labeling of the vertices and edges of a graph such that the weights (colors) of the edges, defined by the sum of its label and the labels of its two endpoints, determine a proper edge coloring of the graph. We propose...
Guardado en:
| Publicado: |
2018
|
|---|---|
| Materias: | |
| Acceso en línea: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_02545330_v_n_p_Borghini http://hdl.handle.net/20.500.12110/paper_02545330_v_n_p_Borghini |
| Aporte de: |
Ejemplares similares
-
An exact algorithm for the edge coloring by total labeling problem
por: Borghini, F., et al. -
A Branch-and-Cut algorithm for graph coloring
por: Méndez Díaz, Isabel, et al.
Publicado: (2006) -
A Branch-and-Cut algorithm for graph coloring
por: Méndez-Díaz, I., et al.
Publicado: (2006) -
A Branch-and-Cut algorithm for graph coloring
por: Méndez-Díaz, I., et al. -
A Branch-and-Cut algorithm for graph coloring
por: Méndez-Díaz, I., et al.
Publicado: (2006)