Add to ORKG..'40 The graph coloring problem is defined, and its impor-tance in several applications is noted. A new algorithm to color graphs is presented and tested against the Welch-Powell algorithm. Significantly better results are obtained on a sequence of three hundred randomly generated graphs. The new algorithm is applied to the solution of
We analyse the problem of executing periodic operations on a minimum number of identical processors ...
The edge-coloring problem is one of the fundamental problems on graphs, which often appears in vario...
Given an undirected simple graph G, an integer k, and a cost cij for each pair of non-adjacent verti...
The graph coloring problem, which is to color the vertices of a simple undirected graph with the min...
A method using graph coloring was developed for optimizing solutions to the timetabling problem, spe...
Graph colouring and its generalizations are useful tools in modelling a wide variety of scheduling...
The graph coloring problem can be stated: “Given an undirected graph, using a minimal number of colo...
This unique textbook treats graph colouring as an algorithmic problem, with a strong emphasis on pra...
Some scheduling problems induce a mixed graph coloring, i.e. an assignment of positive integers (col...
In this paper, we introduce a graph multi-coloring problem where each vertex must be assigned a give...
AbstractGraph coloring is an important problem with its wide variety of applications. The problem is...
SIGLELD:D49375/84 / BLDSC - British Library Document Supply CentreGBUnited Kingdo
We have developed a new algorithm and software for graph coloring by systematically combining severa...
AbstractA graph coloring model is described for handling some types of chromatic scheduling problems...
Timetable scheduling is one of the most common tasks that people face every day. Timetable schedulin...
We analyse the problem of executing periodic operations on a minimum number of identical processors ...
The edge-coloring problem is one of the fundamental problems on graphs, which often appears in vario...
Given an undirected simple graph G, an integer k, and a cost cij for each pair of non-adjacent verti...
The graph coloring problem, which is to color the vertices of a simple undirected graph with the min...
A method using graph coloring was developed for optimizing solutions to the timetabling problem, spe...
Graph colouring and its generalizations are useful tools in modelling a wide variety of scheduling...
The graph coloring problem can be stated: “Given an undirected graph, using a minimal number of colo...
This unique textbook treats graph colouring as an algorithmic problem, with a strong emphasis on pra...
Some scheduling problems induce a mixed graph coloring, i.e. an assignment of positive integers (col...
In this paper, we introduce a graph multi-coloring problem where each vertex must be assigned a give...
AbstractGraph coloring is an important problem with its wide variety of applications. The problem is...
SIGLELD:D49375/84 / BLDSC - British Library Document Supply CentreGBUnited Kingdo
We have developed a new algorithm and software for graph coloring by systematically combining severa...
AbstractA graph coloring model is described for handling some types of chromatic scheduling problems...
Timetable scheduling is one of the most common tasks that people face every day. Timetable schedulin...
We analyse the problem of executing periodic operations on a minimum number of identical processors ...
The edge-coloring problem is one of the fundamental problems on graphs, which often appears in vario...
Given an undirected simple graph G, an integer k, and a cost cij for each pair of non-adjacent verti...