We analyse the problem of executing periodic operations on a minimum number of identical processors under different constraints. The analysis is based on a reformulation of the problem in terms of graph colouring. It is shown that different constraints result in colouring problems defined on different classes of graphs, viz. interval graphs, circular-arc graphs and periodic-interval graphs. We discuss the complexity of these colouring problems in detail
Some scheduling problems induce a mixed graph coloring, i.e. an assignment of positive integers (col...
This thesis consists in successive glimpses of different problems in discrete mathematics related to...
An exact algorithm is presented for determining the interval chromatic number of a weighted graph. T...
We analyse the problem of executing periodic operations on a minimum number of identical processors ...
In this thesis we study some graph colouring problems which arise from mathematical models of freque...
Graph colouring and its generalizations are useful tools in modelling a wide variety of scheduling...
By a proper colouring of a simple graph, we mean an assignment of colours to its vertices with adjac...
In this tutorial paper the representation of the frequency assignment problem as a generalised graph...
..'40 The graph coloring problem is defined, and its impor-tance in several applications is not...
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colourin...
This unique textbook treats graph colouring as an algorithmic problem, with a strong emphasis on pra...
In this thesis we study several graph problems. In the first part, we study the ‘gonality’ of graphs...
We discuss four variants of the graph colouring problem, and present algorithms for solving them. Th...
AbstractA graph coloring model is described for handling some types of chromatic scheduling problems...
In this paper, we introduce a graph multi-coloring problem where each vertex must be assigned a give...
Some scheduling problems induce a mixed graph coloring, i.e. an assignment of positive integers (col...
This thesis consists in successive glimpses of different problems in discrete mathematics related to...
An exact algorithm is presented for determining the interval chromatic number of a weighted graph. T...
We analyse the problem of executing periodic operations on a minimum number of identical processors ...
In this thesis we study some graph colouring problems which arise from mathematical models of freque...
Graph colouring and its generalizations are useful tools in modelling a wide variety of scheduling...
By a proper colouring of a simple graph, we mean an assignment of colours to its vertices with adjac...
In this tutorial paper the representation of the frequency assignment problem as a generalised graph...
..'40 The graph coloring problem is defined, and its impor-tance in several applications is not...
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colourin...
This unique textbook treats graph colouring as an algorithmic problem, with a strong emphasis on pra...
In this thesis we study several graph problems. In the first part, we study the ‘gonality’ of graphs...
We discuss four variants of the graph colouring problem, and present algorithms for solving them. Th...
AbstractA graph coloring model is described for handling some types of chromatic scheduling problems...
In this paper, we introduce a graph multi-coloring problem where each vertex must be assigned a give...
Some scheduling problems induce a mixed graph coloring, i.e. an assignment of positive integers (col...
This thesis consists in successive glimpses of different problems in discrete mathematics related to...
An exact algorithm is presented for determining the interval chromatic number of a weighted graph. T...
DOI
Add to ORKG