This paper describes an exact algorithm for the Equitable Coloring Problem, based on the well known DSatur algorithm for the classic Coloring Problem with new pruning rules specifically derived from the equity constraint. Computational experiences show that our algorithm is competitive with those known in literature.Fil: Méndez Díaz, Isabel. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; ArgentinaFil: Nasini, Graciela Leonor. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; ArgentinaFil: Severin, Daniel Esteban. Universidad Nacional de Rosario. Facultad de Ciencias Exactas, Ingeniería y Agrimensura; Argentin...
We discuss the nearly equitable edge coloring problem on a multigraph and propose an ecient algorith...
An equitable k-coloring of a graph G is a proper k-coloring, for which any two color classes differ ...
DEXCH, a color-exchange exact graph coloring algorithm is presented. On many classes of graphs, DEXC...
This paper describes a new exact algorithm for the Equitable Coloring Problem, a coloring problem wh...
In this work we study the polytope associated with a 0,1-integer programming formulation for the Equ...
The Equitable Coloring Problem is a variant of the Graph Coloring Problem where the sizes of two arb...
We present two new integer programming formulations for the equitable coloring problem. We also prop...
[No abstract available]35C347352Bahiense, L., Jurkiewicz, S., Lozano, A., Pimenta, M., Waga, C., Val...
Abstract An equitable graph coloring is a proper vertex coloring of a graph G where the sizes of the...
In many applications in sequencing and scheduling it is desirable to have an underlaying graph as eq...
An equitable k -coloring of an undirected graph G=(V,E)G=(V,E) is a partition of its vertices into ...
The equitable edge chromatic number is the minimum number of colors required to color the edges of g...
An equitable k-coloring of an undirected graph G = (V,E) is a partition of its vertices into k disjo...
This paper describes a new exact algorithm PASS for the vertex coloring problem based on the well kn...
Los problemas de coloreo de grafos constituyen una familia de problemas de una gran relevancia tanto...
We discuss the nearly equitable edge coloring problem on a multigraph and propose an ecient algorith...
An equitable k-coloring of a graph G is a proper k-coloring, for which any two color classes differ ...
DEXCH, a color-exchange exact graph coloring algorithm is presented. On many classes of graphs, DEXC...
This paper describes a new exact algorithm for the Equitable Coloring Problem, a coloring problem wh...
In this work we study the polytope associated with a 0,1-integer programming formulation for the Equ...
The Equitable Coloring Problem is a variant of the Graph Coloring Problem where the sizes of two arb...
We present two new integer programming formulations for the equitable coloring problem. We also prop...
[No abstract available]35C347352Bahiense, L., Jurkiewicz, S., Lozano, A., Pimenta, M., Waga, C., Val...
Abstract An equitable graph coloring is a proper vertex coloring of a graph G where the sizes of the...
In many applications in sequencing and scheduling it is desirable to have an underlaying graph as eq...
An equitable k -coloring of an undirected graph G=(V,E)G=(V,E) is a partition of its vertices into ...
The equitable edge chromatic number is the minimum number of colors required to color the edges of g...
An equitable k-coloring of an undirected graph G = (V,E) is a partition of its vertices into k disjo...
This paper describes a new exact algorithm PASS for the vertex coloring problem based on the well kn...
Los problemas de coloreo de grafos constituyen una familia de problemas de una gran relevancia tanto...
We discuss the nearly equitable edge coloring problem on a multigraph and propose an ecient algorith...
An equitable k-coloring of a graph G is a proper k-coloring, for which any two color classes differ ...
DEXCH, a color-exchange exact graph coloring algorithm is presented. On many classes of graphs, DEXC...