Cargando…

A Guide to Graph Colouring Algorithms and Applications /

This 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...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor principal: Lewis, R.M.R (Autor)
Autor Corporativo: SpringerLink (Online service)
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Cham : Springer International Publishing : Imprint: Springer, 2016.
Edición:1st ed. 2016.
Temas:
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-319-25730-3
003 DE-He213
005 20220118083116.0
007 cr nn 008mamaa
008 151026s2016 sz | s |||| 0|eng d
020 |a 9783319257303  |9 978-3-319-25730-3 
024 7 |a 10.1007/978-3-319-25730-3  |2 doi 
050 4 |a QA76.9.A43 
072 7 |a UMB  |2 bicssc 
072 7 |a COM051300  |2 bisacsh 
072 7 |a UMB  |2 thema 
082 0 4 |a 518.1  |2 23 
100 1 |a Lewis, R.M.R.  |e author.  |4 aut  |4 http://id.loc.gov/vocabulary/relators/aut 
245 1 2 |a A Guide to Graph Colouring  |h [electronic resource] :  |b Algorithms and Applications /  |c by R.M.R. Lewis. 
250 |a 1st ed. 2016. 
264 1 |a Cham :  |b Springer International Publishing :  |b Imprint: Springer,  |c 2016. 
300 |a XIV, 253 p.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
505 0 |a Introduction 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 |a This 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. 
650 0 |a Algorithms. 
650 0 |a Mathematical optimization. 
650 0 |a Operations research. 
650 0 |a Engineering mathematics. 
650 0 |a Engineering-Data processing. 
650 1 4 |a Algorithms. 
650 2 4 |a Optimization. 
650 2 4 |a Operations Research and Decision Theory. 
650 2 4 |a Mathematical and Computational Engineering Applications. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783319257280 
776 0 8 |i Printed edition:  |z 9783319257297 
776 0 8 |i Printed edition:  |z 9783319372822 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-319-25730-3  |z Texto Completo 
912 |a ZDB-2-SCS 
912 |a ZDB-2-SXCS 
950 |a Computer Science (SpringerNature-11645) 
950 |a Computer Science (R0) (SpringerNature-43710)