A supernodal formulation of vertex colouring with applications in course timetabling

Citation

Burke E, Maracek J, Parkes AJ & Rudova H (2010) A supernodal formulation of vertex colouring with applications in course timetabling. Annals of Operations Research, 179 (1), pp. 105-130. https://doi.org/10.1007/s10479-010-0716-z

Abstract
For many problems in scheduling and timetabling, the choice of a mathematical programming formulation is determined by the formulation of the graph colouring component. This paper briefly surveys seven known integer programming formulations of vertex colouring and introduces a new approach using "supernodes". In the definition of George and McIntyre (SIAM J. Numer. Anal. 15(1):90-112, 1978), a "supernode" is a complete subgraph, within which every pair of vertices have the same neighbourhood outside of the subgraph. A polynomial-time algorithm for obtaining the best possible partition of an arbitrary graph into supernodes is given. This makes it possible to use any formulation of vertex multicolouring to encode vertex colouring. Results of empirical tests on benchmark instances in graph colouring (DIMACS) and timetabling (Udine Course Timetabling) are also provided and discussed.

Keywords
Vertex colouring; Graph colouring; Multicolouring; Supernode; Module; Integer programming

Journal
Annals of Operations Research: Volume 179, Issue 1