000 04143nam a22006015i 4500
001 978-3-030-81054-2
003 DE-He213
005 20240423130058.0
007 cr nn 008mamaa
008 211007s2021 sz | s |||| 0|eng d
020 _a9783030810542
_9978-3-030-81054-2
024 7 _a10.1007/978-3-030-81054-2
_2doi
050 4 _aQA75.5-76.95
072 7 _aUYA
_2bicssc
072 7 _aCOM014000
_2bisacsh
072 7 _aUYA
_2thema
082 0 4 _a004.0151
_223
100 1 _aLewis, R. M. R.
_eauthor.
_4aut
_4http://id.loc.gov/vocabulary/relators/aut
245 1 0 _aGuide to Graph Colouring
_h[electronic resource] :
_bAlgorithms and Applications /
_cby R. M. R. Lewis.
250 _a2nd ed. 2021.
264 1 _aCham :
_bSpringer International Publishing :
_bImprint: Springer,
_c2021.
300 _aXIV, 304 p. 145 illus., 4 illus. in color.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aTexts in Computer Science,
_x1868-095X
505 0 _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.
520 _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. .
650 0 _aComputer science.
650 0 _aOperations research.
650 0 _aGraph theory.
650 0 _aMathematical optimization.
650 0 _aEngineering mathematics.
650 0 _aEngineering
_xData processing.
650 1 4 _aTheory of Computation.
650 2 4 _aOperations Research and Decision Theory.
650 2 4 _aGraph Theory.
650 2 4 _aOptimization.
650 2 4 _aMathematical and Computational Engineering Applications.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783030810535
776 0 8 _iPrinted edition:
_z9783030810559
776 0 8 _iPrinted edition:
_z9783030810566
830 0 _aTexts in Computer Science,
_x1868-095X
856 4 0 _uhttps://doi.org/10.1007/978-3-030-81054-2
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
942 _cSPRINGER
999 _c184797
_d184797