GRAPH COLOURING PROBLEMS AND THEIR APPLICATIONS IN SCHEDULING (2003)
by
Dániel Marx
BibTeX
@MISC{Marx03graphcolouring,
author = {Dániel Marx},
title = {GRAPH COLOURING PROBLEMS AND THEIR APPLICATIONS IN SCHEDULING},
year = {2003}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Graph colouring and its generalizations are useful tools in modelling a wide variety of scheduling and assignment problems. In this paper we review several variants of graph colouring, such as precolouring extension, list colouring, multicolouring, minimum sum colouring, and discuss their applications in scheduling.
