A Guide to Graph Colouring - hardcover

Book in our database since 2015-10-23T01:39:40+01:00 (London)
Detail page last modified on 2024-02-18T14:07:14+00:00 (London)
ISBN/EAN: 9783319257280

ISBN - alternate spelling:
3-319-25728-5, 978-3-319-25728-0
Alternate spelling and related search-keywords:
Book author: lewis
Book title: colouring, colour guide, graph algorithms

Information from Publisher

Author: R.M.R. Lewis
Title: A Guide to Graph Colouring - Algorithms and Applications
Publisher: Springer; Springer International Publishing
253 Pages
Publishing year: 2015-11-04
Cham; CH
Printed / Made in
Weight: 5,266 kg
Language: English
117,69 € (DE)
120,99 € (AT)
130,00 CHF (CH)
Not available, publisher indicates OP

BB; Book; Hardcover, Softcover / Informatik, EDV/Informatik; Algorithmen und Datenstrukturen; Verstehen; Combinatorial Optimization; Graph Theory; Heuristics; Metaheuristics; Operations Research; Optimization; Scheduling; algorithm analysis and problem complexity; B; Algorithm Analysis and Problem Complexity; Optimization; Operations Research/Decision Theory; Mathematical and Computational Engineering; Algorithms; Optimization; Operations Research and Decision Theory; Mathematical and Computational Engineering Applications; Computer Science; Optimierung; Unternehmensforschung; Management: Entscheidungstheorie; Mathematik für Ingenieure; EA; BC; BB

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.

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.

“The book gives a comprehensive description and handling on arguably one of the most important notions of combinatorics—graph coloring. … The book is nicely written, and carries a big pile of information valuable for both users and researchers in the field.” (András Sándor Pluhár, Mathematical Reviews, February, 2017)

“This well-written book will serve as a utilitarian guide to graph coloring and its practical applications. It includes many definitions, theorems, proofs, algorithms, and pointers for further reading. The book will be helpful for teaching courses on graph coloring to students of mathematics and computer science. I strongly recommend it for the intended audience.” (S. V. Nagaraj, Computing Reviews, computingreviews.com, June, 2016)

“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)

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.

Supported by online suite of graph colouring algorithms, implemented in C++

Focuses on state-of-the-art algorithmic solutions to classic problems such as seating plans, sports leagues, and university timetables

Suitable for graduate courses in computer science, operations research, mathematics, and engineering