LEADER 04241nam  22007095  450 
001 9910502613203321
005 20251113193350.0
010   $a3-030-81054-2
024 7 $a10.1007/978-3-030-81054-2
035   $a(CKB)5140000000012945
035   $a(MiAaPQ)EBC6747444
035   $a(Au-PeEL)EBL6747444
035   $a(OCoLC)1274060612
035   $a(DE-He213)978-3-030-81054-2
035   $a(PPN)258296895
035   $a(EXLCZ)995140000000012945
100   $a20211007d2021      u|         0
101 0 $aeng
135   $aurcnu||||||||
181   $ctxt$2rdacontent
182   $cc$2rdamedia
183   $acr$2rdacarrier
200 10$aGuide to Graph Colouring $eAlgorithms and Applications /$fby R. M. R. Lewis
205   $a2nd ed. 2021.
210  1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2021.
215   $a1 online resource (315 pages)
225 1 $aTexts in Computer Science,$x1868-095X
311 08$a3-030-81053-4 
327   $a1. 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.
330   $aThis 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. Topics and features: Suitable for graduate or upper-undergraduate courses in computer science, operations research, mathematics, and engineering Focuses on state-of-the-art algorithmic solutions to classic, real-world problems Supported by online suite of downloadable code Includes many examples, suggestions for further reading, and historical notes This fine new edition will be of real value to graduate students, researchers, and practitioners in the areas of operations research, theoretical computer science, optimization, and computational intelligence. It thus will fulfill a dual role as both a key textbook for academia and a guidebook for professional self-study and pursuits. Dr. Rhyd Lewis is a reader in operational research at Cardiff School of Mathematics, Cardiff University, UK. Previously he was a lecturer in quantitative methods at Cardiff Business School. .
410  0$aTexts in Computer Science,$x1868-095X
606   $aComputer science
606   $aOperations research
606   $aGraph theory
606   $aMathematical optimization
606   $aEngineering mathematics
606   $aEngineering$xData processing
606   $aTheory of Computation
606   $aOperations Research and Decision Theory
606   $aGraph Theory
606   $aOptimization
606   $aMathematical and Computational Engineering Applications
615  0$aComputer science.
615  0$aOperations research.
615  0$aGraph theory.
615  0$aMathematical optimization.
615  0$aEngineering mathematics.
615  0$aEngineering$xData processing.
615 14$aTheory of Computation.
615 24$aOperations Research and Decision Theory.
615 24$aGraph Theory.
615 24$aOptimization.
615 24$aMathematical and Computational Engineering Applications.
676   $a511.56
700   $aLewis$b R. M. R.$01072930
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bMiAaPQ
906   $aBOOK
912   $a9910502613203321
996   $aGuide to Graph Colouring$92569144
997   $aUNINA