000			03630nam a22004215i 4500
999			_c361623 _d361623 _x1
001			361623
003			ES-MaUEC
005			20230102121414.0
006			a||||fo|||| 00| 0
007			cr nn nnnaamaa
008			211007s2021 sz | o |||| 0|eng d
020			_a9783030810542
024	7		_a10.1007/978-3-030-81054-2 _2doi
040			_aES-MaUEC _bspa _cES-MaUEC _dES-MaUEC
050		4	_aQA90 _b2021 EB
100			_aLewis, Rhyd M. R. _997842
245	1	0	_aGuide to Graph Colouring _bAlgorithms and Applications _cby R. M. R. Lewis.
250			_aSecond edition 2021
264		1	_aCham _bSpringer International Publising _c2021
300			_a1 recurso en línea (XIV, 304 páginas) _b145 ilustraciones, 4 ilustraciones a color
336			_2rdacontent _aTexto _btxt
337			_2rdamedia _aelectrónico _bc
338			_2rdacarrier _arecurso electrónico _bcr
347			_aarchivo de texto _bPDF
490	0		_aTexts in Computer Science _x1868-095X
490	0		_aComputer Science (SpringerNature-11645)
490	0		_aComputer Science (R0) (SpringerNature-43710)
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	3		_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. .
988			_aSpringer_Computer_2021
650		7	_2embne _aIlustración científica _9681331
776	0	8	_iPrinted edition: _z9783030810535
776	0	8	_iPrinted edition: _z9783030810559
776	0	8	_iPrinted edition: _z9783030810566
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://doi.org/10.1007/978-3-030-81054-2 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
942			_2lcc _cLE
998			_b01/2022 _dz _eh _zSI