Overview
- Supported by online suite of graph colouring algorithms, implemented in C++
- Focuses on state-of-the-art algorithmic solutions to classic problems
- Suitable for graduate or upper-undergraduate courses in computer science
Part of the book series: Texts in Computer Science (TCS)
Access this book
Tax calculation will be finalised at checkout
Other ways to access
Table of contents (9 chapters)
-
Front Matter
-
Back Matter
Keywords
About this book
This textbook treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. The author describes and analyses some of the best-known algorithms for colouring graphs, focusing on whether these heuristics can provide optimal solutions in some cases; how they perform on graphs where the chromatic number is unknown; and whether they can produce better solutions than other algorithms for certain types of graphs, and why.
The introductory chapters explain graph colouring, complexity theory, bounds and constructive algorithms. The author then shows how advanced, graph colouring techniques can be applied to classic real-world operational research problems such as designing seating plans, sports scheduling, and university timetabling. He includes many examples, suggestions for further reading, and historical notes, and the book is supplemented by an online suite of downloadable code.
The book is of value to researchers, graduate students, and practitioners in the areas of operations research, theoretical computer science, optimization, and computational intelligence. The reader should have elementary knowledge of sets, matrices, and enumerative combinatorics.
Authors and Affiliations
About the author
Dr. Rhyd Lewis is a reader in operational research at Cardiff School of Mathematics, Cardiff University. Previously, he was a lecturer in quantitative methods at Cardiff Business School. He holds a Ph.D. in Computer Science and Operational Research from Edinburgh Napier University. His research interests cover algorithmic graph theory and the analysis and application of metaheuristic algorithms. He is a cofounder and associate editor of the Intl. J. of Metaheuristics.
Bibliographic Information
Book Title: Guide to Graph Colouring
Book Subtitle: Algorithms and Applications
Authors: R. M. R. Lewis
Series Title: Texts in Computer Science
DOI: https://doi.org/10.1007/978-3-030-81054-2
Publisher: Springer Cham
eBook Packages: Computer Science, Computer Science (R0)
Copyright Information: The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2021
Hardcover ISBN: 978-3-030-81053-5Published: 08 October 2021
Softcover ISBN: 978-3-030-81056-6Published: 08 October 2022
eBook ISBN: 978-3-030-81054-2Published: 07 October 2021
Series ISSN: 1868-0941
Series E-ISSN: 1868-095X
Edition Number: 2
Number of Pages: XIV, 304
Number of Illustrations: 141 b/w illustrations, 4 illustrations in colour
Topics: Theory of Computation, Operations Research/Decision Theory, Graph Theory, Optimization, Mathematical and Computational Engineering