@book{b324dac1afee4125994f422b930fa1ee,

title = "Periodic assignment and graph colouring",

abstract = "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 that are defined on different classes of graphs, viz. interval graphs, circular-arc graphs and periodic-interval graphs. We discuss the colouring of such graphs in detail. Keywords: periodic assignment, graph colouring, interval graphs, circuJar-arc graphs, periodic-interval graphs.",

author = "J.H.M. Korst and E.H.L. Aarts and J.K. Lenstra and J. Wessels",

year = "1991",

language = "English",

series = "Memorandum COSOR",

publisher = "Technische Universiteit Eindhoven",

}