{"product_id":"guide-to-graph-colouring-algorithms-and-applications-paperback","title":"Guide to Graph Colouring: Algorithms and Applications - Paperback","description":"\u003cp\u003eby \u003cb\u003eR. M. R. Lewis\u003c\/b\u003e (Author)\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003eThis 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.\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e \u003cp\u003eThe 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.\u003c\/p\u003e \u003cp\u003e \u003c\/p\u003e \u003cp\u003eThe 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.\u003c\/p\u003e\u003ch3\u003eBack Jacket\u003c\/h3\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003eThis unique textbook treats graph colouring as an algorithmic problem, with a strong emphasis on practical applications. \u003c\/p\u003e\u003cp\u003eThe 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. \u003c\/p\u003e \u003cp\u003eIntroductory 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.\u003c\/p\u003e\u003cp\u003e\u003cb\u003eTopics and features: \u003c\/b\u003e\u003c\/p\u003e\u003cp\u003e\u003c\/p\u003e\u003cul\u003e\n\u003cli\u003eSuitable for graduate or upper-undergraduate courses in computer science, operations research, mathematics, and engineering\u003c\/li\u003e\n\u003cli\u003eFocuses on state-of-the-art algorithmic solutions to classic, real-world problems\u003c\/li\u003e\n\u003cli\u003eSupported by online suite of downloadable code\u003c\/li\u003e\n\u003cli\u003eIncludes many examples, suggestions for further reading, and historical notes\u003c\/li\u003e\n\u003c\/ul\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003eThis 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.\u003cbr\u003e\u003c\/p\u003e\u003cp\u003e\u003cb\u003eDr. Rhyd Lewis\u003c\/b\u003e 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. \u003cbr\u003e\u003c\/p\u003e\u003ch3\u003eAuthor Biography\u003c\/h3\u003e\u003cp\u003e\u003c\/p\u003e\u003cp\u003eDr. 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.\u003c\/p\u003e\u003cdiv\u003e\n\u003cstrong\u003eNumber of Pages:\u003c\/strong\u003e 304\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003eDimensions:\u003c\/strong\u003e 0.67 x 9.21 x 6.14 IN\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003eIllustrated:\u003c\/strong\u003e Yes\u003c\/div\u003e\u003cdiv\u003e\n\u003cstrong\u003ePublication Date:\u003c\/strong\u003e October 08, 2022\u003c\/div\u003e","brand":"Books by splitShops","offers":[{"title":"Default Title","offer_id":42719550210111,"sku":"9783030810566","price":116.62,"currency_code":"USD","in_stock":true}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/0105\/8226\/1823\/files\/9e2ba05984af469574a793ab470f0385.webp?v=1765086030","url":"https:\/\/dhlswag.com\/products\/guide-to-graph-colouring-algorithms-and-applications-paperback","provider":"BBB","version":"1.0","type":"link"}