A Guide to Graph Colouring
Springer International Publishing (Verlag)
978-3-319-25728-0 (ISBN)
- Titel erscheint in neuer Auflage
- Artikel merken
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.
Dr. Rhyd Lewis is a lecturer 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 the analysis and application of metaheuristic algorithms, with particular focus on timetabling, graph colouring, and bin packing, vehicle routing, arc routing, and grouping/partitioning problems, and he has been a program committee member for the key related conferences, such as EvoCop, GECCO, MIC, and PATAT, and he is a cofounder and associate editor of the Intl. J. of Metaheuristics.
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)
| Erscheinungsdatum | 08.10.2016 |
|---|---|
| Zusatzinfo | XIV, 253 p. |
| Verlagsort | Cham |
| Sprache | englisch |
| Maße | 155 x 235 mm |
| Themenwelt | Informatik ► Theorie / Studium ► Algorithmen |
| Mathematik / Informatik ► Mathematik | |
| Wirtschaft ► Betriebswirtschaft / Management | |
| Schlagworte | Algorithm analysis and problem complexity • Appl.Mathematics/Computational Methods of Engineer • combinatorial optimization • Computer Science • graph theory • Heuristics • Metaheuristics • Operation Research/Decision Theory • Operations Research • Optimization • Scheduling |
| ISBN-10 | 3-319-25728-5 / 3319257285 |
| ISBN-13 | 978-3-319-25728-0 / 9783319257280 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
