STORRE
STORRE: Stirling Online Research Repository
http://hdl.handle.net/1893/15733| Appears in Collections: | Computing Science and Mathematics Journal Articles |
| Peer Review Status: | Refereed |
| Title: | A supernodal formulation of vertex colouring with applications in course timetabling |
| Author(s): | Burke, Edmund Maracek, Jakub Parkes, Andrew J Rudova, Hana |
| Contact Email: | e.k.burke@stir.ac.uk |
| Keywords: | Vertex colouring Graph colouring Multicolouring Supernode Module Integer programming |
| Issue Date: | Sep-2010 |
| Date Deposited: | 3-Jul-2013 |
| 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. |
| DOI Link: | 10.1007/s10479-010-0716-z |
| Rights: | The publisher does not allow this work to be made publicly available in this Repository. Please use the Request a Copy feature at the foot of the Repository record to request a copy directly from the author. You can only request a copy if you wish to use this work for your own research or private study. |
| Licence URL(s): | http://www.rioxx.net/licenses/under-embargo-all-rights-reserved |
| File | Description | Size | Format | |
|---|---|---|---|---|
| A supernodal formulation of vertex colouring with applications in course timetabling.pdf | Fulltext - Published Version | 677.19 kB | Adobe PDF | Under Permanent Embargo Request a copy |
Note: If any of the files in this item are currently embargoed, you can request a copy directly from the author by clicking the padlock icon above. However, this facility is dependent on the depositor still being contactable at their original email address.
This item is protected by original copyright |
Items in the Repository are protected by copyright, with all rights reserved, unless otherwise indicated.
The metadata of the records in the Repository are available under the CC0 public domain dedication: No Rights Reserved https://creativecommons.org/publicdomain/zero/1.0/
If you believe that any material held in STORRE infringes copyright, please contact library@stir.ac.uk providing details and we will remove the Work from public display in STORRE and investigate your claim.