## Find a copy online

### Links to this item

lib.myilibrary.com Connect to MyiLibrary resource.

Ebook Library Click here to view book

Show all links

## Find a copy in the library

Finding libraries that hold this item...

## Details

Genre/Form: | Electronic books |
---|---|

Additional Physical Format: | Printed edition: |

Material Type: | Document, Internet resource |

Document Type: | Internet Resource, Computer File |

All Authors / Contributors: |
Rhyd M R Lewis |

ISBN: | 9783319257303 3319257307 |

OCLC Number: | 927140677 |

Description: | 1 online resource (xiv, 253 pages) : illustrations. |

Contents: | Introduction to Graph Colouring -- Bounds and Constructive Algorithms -- Advanced Techniques for Graph Colouring -- Algorithm Case Studies -- Applications and Extensions -- Designing Seating Plans -- Designing Sports Leagues -- Designing University Timetables -- App. A, Computing Resources -- References -- Index. |

Responsibility: | R.M.R. Lewis. |

More information: |

### Abstract:

This book 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 arbitrary 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, and bounds and constructive algorithms. The author then shows how advanced, modern techniques can be applied to classic real-world operational research problems such as seating plans, sports scheduling, and university timetabling. He includes many examples, suggestions for further reading, and historical notes, and the book is supplemented by a website with an online suite of downloadable code. The book will be 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.

## Reviews

*Editorial reviews*

Publisher Synopsis

"The book is a comprehensive guide to graph colouring algorithms. ... The book is a nice textbook for both undergraduate and graduate students in the areas of operations research and theoretical computer science. ... Finally, it is a good source of knowledge for practitioners." (Marcin Anholcer, zbMATH 1330.05002, 2016) Read more...

*User-contributed reviews*

Add a review and share your thoughts with other readers.
Be the first.

Add a review and share your thoughts with other readers.
Be the first.

## Tags

Add tags for "A guide to graph colouring : algorithms and applications".
Be the first.