Periodic assignment and graph colouring

J.H.M. Korst, E.H.L. Aarts, J.K. Lenstra, J. Wessels

Onderzoeksoutput: Boek/rapportRapportAcademic

84 Downloads (Pure)

Samenvatting

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.
Originele taal-2Engels
Plaats van productieEindhoven
UitgeverijTechnische Universiteit Eindhoven
Aantal pagina's13
StatusGepubliceerd - 1991

Publicatie series

NaamMemorandum COSOR
Volume9114
ISSN van geprinte versie0926-4493

Vingerafdruk

Duik in de onderzoeksthema's van 'Periodic assignment and graph colouring'. Samen vormen ze een unieke vingerafdruk.

Citeer dit