Guide to Graph Colouring: Algorithms and Applications, 2nd Edition
- Length: 318 pages
- Edition: 2
- Language: English
- Publisher: Springer
- Publication Date: 2021-10-08
- ISBN-10: 3030810534
- ISBN-13: 9783030810535
- Sales Rank: #0 (See Top 100 Books)
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.
Cover Front Matter 1. Introduction to Graph Colouring 2. Problem Complexity 3. Bounds and Constructive Heuristics 4. Advanced Techniques for Graph Colouring 5. Algorithm Case Studies 6. Applications and Extensions 7. Designing Seating Plans 8. Designing Sports Leagues 9. Designing University Timetables Back Matter
Donate to keep this site alive
1. Disable the AdBlock plugin. Otherwise, you may not get any links.
2. Solve the CAPTCHA.
3. Click download link.
4. Lead to download server to download.