000			03088nam a22003975i 4500
001			85125
003			ES-MaUEC
005			20230207040456.0
007			cr nn 008mamaa
008			151026s2016 gw a s 001 0 eng d
020			_a9783319257303
024	7		_a10.1007/978-3-319-25730-3 _2doi
040			_aES-MaUEC
050		4	_aQA90 _b.L49 2016 EB
082	0	4	_a005.1
100	1		_aLewis, Rhyd M. R. _0local _997842 _0Local
245	1	2	_aA Guide to Graph Colouring : _bAlgorithms and Applications _cby R.M.R. Lewis
250			_a1st ed.
264		1	_aCham _bSpringer International Publishing _c2016
300			_a1 recurso en línea (XIV, 253 p.) _b115 ilustraciones en color
336			_aTexto (visual) _btxt _2rdacontent
337			_aelectrónico _bc _2rdamedia
338			_arecurso electrónico _bcr _2rdacarrier
505	0		_aIntroduction to Graph Colouring -- Bounds and Constructive Algorithms -- Advanced Techniques for Graph Colouring -- Algorithm Case Studies -- Applications and Extensions -- Designing Seating Plans -- Designing Sports Leagues -- Designing University Timetables -- App. A, Computing Resources -- References -- Index.
520	3		_aThis book 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 arbitrary 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, and bounds and constructive algorithms. The author then shows how advanced, modern techniques can be applied to classic real-world operational research problems such as seating plans, sports scheduling, and university timetabling. He includes many examples, suggestions for further reading, and historical notes, and the book is supplemented by a website with an online suite of downloadable code. The book will be 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.
710	2		_aSpringerLink (Online service) _0Local _9106996
942			_2lcc _cLE
988			_aEBOOK, EBSPRINGER
650		7	_aMetodología _0comprobar BNE19900962883 _2embne _9138667
650		7	_aAlgoritmos _0comprobar BNE19900994945 _2embne _9141162
856	4	0	_uhttps://go.openathens.net/redirector/universidadeuropea.es?url=https://link.springer.com/book/10.1007/978-3-319-25730-3 _zAcceso a este recurso digital (usuarios Universidad Europea de Madrid)
901			_ai9783319257303
907			_a.b12944038 _b13-10-17 _c21-11-16
998			_am _a_alco _a_vill _b13-10-17 _cm _dz _ei _feng _ggw _h2
945			_aQA90 .L49 2016 EB _g1 _ieBOOK _j0 _lmae _o- _pEUR0.00 _q- _r- _sb _t15 _u0 _v0 _w0 _x0 _y.i11588172 _z06-04-17
999			_c85125 _d85125 _x1