Texts in Computer Science
cover

Guide to Graph Colouring

Algorithms and Applications

Authors: Lewis, R.M.R.

  • 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
see more benefits

Buy this book

eBook $69.99
price for USA in USD
  • The eBook version of this title will be available soon
  • Due: December 5, 2021
  • ISBN 978-3-030-81054-2
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices
Hardcover $89.99
price for USA in USD
  • Customers within the U.S. and Canada please contact Customer Service at +1-800-777-4643, Latin America please contact us at +1-212-460-1500 (24 hours a day, 7 days a week). Pre-ordered printed titles are excluded from promotions.
  • Due: November 7, 2021
  • ISBN 978-3-030-81053-5
  • Free shipping for individuals worldwide
  • Institutional customers should get in touch with their account manager
  • Covid-19 shipping restrictions
About this Textbook

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.

About the authors

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.

Buy this book

eBook $69.99
price for USA in USD
  • The eBook version of this title will be available soon
  • Due: December 5, 2021
  • ISBN 978-3-030-81054-2
  • Digitally watermarked, DRM-free
  • Included format:
  • ebooks can be used on all reading devices
Hardcover $89.99
price for USA in USD
  • Customers within the U.S. and Canada please contact Customer Service at +1-800-777-4643, Latin America please contact us at +1-212-460-1500 (24 hours a day, 7 days a week). Pre-ordered printed titles are excluded from promotions.
  • Due: November 7, 2021
  • ISBN 978-3-030-81053-5
  • Free shipping for individuals worldwide
  • Institutional customers should get in touch with their account manager
  • Covid-19 shipping restrictions
Loading...

Services for this Book

Bibliographic Information

Bibliographic Information
Book Title
Guide to Graph Colouring
Book Subtitle
Algorithms and Applications
Authors
Series Title
Texts in Computer Science
Copyright
2021
Publisher
Springer International Publishing
Copyright Holder
The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG
eBook ISBN
978-3-030-81054-2
DOI
10.1007/978-3-030-81054-2
Hardcover ISBN
978-3-030-81053-5
Series ISSN
1868-0941
Edition Number
2
Number of Pages
XIV, 304
Number of Illustrations
141 b/w illustrations, 4 illustrations in colour
Topics