A Guide to Graph Colouring (Record no. 54572)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03203nam a22005175i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-319-25730-3 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20200421111654.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 151026s2016 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783319257303 |
| -- | 978-3-319-25730-3 |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 005.1 |
| 100 1# - AUTHOR NAME | |
| Author | Lewis, R.M.R. |
| 245 12 - TITLE STATEMENT | |
| Title | A Guide to Graph Colouring |
| Sub Title | Algorithms and Applications / |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | XIV, 253 p. |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Remark 2 | 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 ## - SUMMARY, ETC. | |
| Summary, etc | 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. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/978-3-319-25730-3 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Cham : |
| -- | Springer International Publishing : |
| -- | Imprint: Springer, |
| -- | 2016. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Operations research. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Decision making. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Algorithms. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Mathematical optimization. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Applied mathematics. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Engineering mathematics. |
| 650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Algorithm Analysis and Problem Complexity. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Optimization. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Operation Research/Decision Theory. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Appl.Mathematics/Computational Methods of Engineering. |
| 912 ## - | |
| -- | ZDB-2-SCS |
No items available.