Guide to Graph Colouring - neues Buch

Buch in der Datenbank seit 2021-08-22T22:34:56+02:00 (Berlin)
Detailseite zuletzt geändert am 2024-04-10T21:03:16+02:00 (Berlin)
ISBN/EAN: 9783030810542

ISBN - alternative Schreibweisen:
978-3-030-81054-2
Alternative Schreibweisen und verwandte Suchbegriffe:
Titel des Buches: colouring

Daten vom Verlag:

Autor/in: R. M. R. Lewis
Titel: Texts in Computer Science; Guide to Graph Colouring - Algorithms and Applications
Verlag: Springer; Springer International Publishing
304 Seiten
Erscheinungsjahr: 2021-10-07
Cham; CH
Sprache: Englisch
58,84 € (DE)
60,50 € (AT)
65,00 CHF (CH)
Available
XIV, 304 p. 145 illus., 4 illus. in color.

EA; E107; eBook; Nonbooks, PBS / Informatik, EDV/Informatik; Theoretische Informatik; Verstehen; Combinatorial Optimization; Graph Theory; Heuristics; Metaheuristics; Operations Research; Optimization; Scheduling; B; Theory of Computation; Operations Research and Decision Theory; Graph Theory; Optimization; Mathematical and Computational Engineering Applications; Computer Science; Unternehmensforschung; Management: Entscheidungstheorie; Kombinatorik und Graphentheorie; Optimierung; Mathematik für Ingenieure; BB

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.

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.

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.

This unique textbook treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. 

The work 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. 

Introductory chapters explain graph colouring, complexity theory, bounds and constructive algorithms. Further exposition 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.  Readers should have elementary knowledge of sets, matrices, and enumerative combinatorics.