Abstract
In this chapter we present detailed descriptions of six high-performance algorithms for the graph colouring problem. Implementations of each of these can be found in the online suite of graph colouring algorithms described in Section 1.6.1 and Appendix A.1. In Section 4.2 onwards we then compare the performance of these algorithms over a wide range of graphs in order to gauge their relative strengths and weaknesses.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Lewis, R.M.R. (2016). Algorithm Case Studies. In: A Guide to Graph Colouring. Springer, Cham. https://doi.org/10.1007/978-3-319-25730-3_4
Download citation
DOI: https://doi.org/10.1007/978-3-319-25730-3_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25728-0
Online ISBN: 978-3-319-25730-3
eBook Packages: Computer ScienceComputer Science (R0)