Zum Hauptinhalt springen Zur Suche springen Zur Hauptnavigation springen
Beschreibung
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.
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.
Über den Autor
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.
Zusammenfassung

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

Inhaltsverzeichnis

1. Introduction to Graph Colouring.- 2. Bounds and Constructive Algorithms.- 3. Advanced Techniques for Graph Colouring.- 4. Algorithm Case Studies.- 5. Applications and Extensions.- 6. Designing Seating Plans.- 7. Designing Sports Leagues.- 8. Designing University Timetables.

Details
Erscheinungsjahr: 2022
Genre: Informatik, Mathematik, Medizin, Naturwissenschaften, Technik
Rubrik: Naturwissenschaften & Technik
Medium: Taschenbuch
Reihe: Texts in Computer Science
Inhalt: xiv
304 S.
141 s/w Illustr.
4 farbige Illustr.
304 p. 145 illus.
4 illus. in color.
ISBN-13: 9783030810566
ISBN-10: 3030810569
Sprache: Englisch
Einband: Kartoniert / Broschiert
Autor: Lewis, R. M. R.
Auflage: Second Edition 2021
Hersteller: Springer
Texts in Computer Science
Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, D-69121 Heidelberg, juergen.hartmann@springer.com
Maße: 235 x 155 x 18 mm
Von/Mit: R. M. R. Lewis
Erscheinungsdatum: 08.10.2022
Gewicht: 0,487 kg
Artikel-ID: 124663378

Ähnliche Produkte