國立虎尾科技大學 |

Guide to Graph Colouring = Algorithms and Applications /

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	Guide to Graph Colouring/ by R. M. R. Lewis.
其他題名:	Algorithms and Applications /
作者:	Lewis, R. M. R.
面頁冊數:	XIV, 304 p. 145 illus., 4 illus. in color.online resource. :
Contained By:	Springer Nature eBook
標題:	Mathematical and Computational Engineering. -
電子資源:	https://doi.org/10.1007/978-3-030-81054-2
ISBN:	9783030810542

Guide to Graph Colouring = Algorithms and Applications /
Lewis, R. M. R.

Guide to Graph ColouringAlgorithms and Applications /[electronic resource] :by R. M. R. Lewis. - 2nd ed. 2021. - XIV, 304 p. 145 illus., 4 illus. in color.online resource. - Texts in Computer Science,1868-095X. - Texts in Computer Science,.

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

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

ISBN: 9783030810542

Standard No.: 10.1007/978-3-030-81054-2doiSubjects--Topical Terms:

1139415
Mathematical and Computational Engineering.

LC Class. No.: QA75.5-76.95

Dewey Class. No.: 004.0151

Guide to Graph Colouring = Algorithms and Applications /
LDR:03491nam a22004335i 4500 001 1055828
003 DE-He213
005 20211007104716.0
007 cr nn 008mamaa
008 220103s2021 sz | s |||| 0|eng d
020 $a 9783030810542 $9 978-3-030-81054-2
024 7 $a 10.1007/978-3-030-81054-2 $2 doi
035 $a 978-3-030-81054-2
050 4 $a QA75.5-76.95
050 4 $a QA76.63
072 7 $a UY $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a UY $2 thema
072 7 $a UYA $2 thema
082 0 4 $a 004.0151 $2 23
100 1 $a Lewis, R. M. R. $e author. $4 aut $4 http://id.loc.gov/vocabulary/relators/aut $3 1361113
245 1 0 $a Guide to Graph Colouring $h [electronic resource] : $b Algorithms and Applications / $c by R. M. R. Lewis.
250 $a 2nd ed. 2021.
264 1 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a XIV, 304 p. 145 illus., 4 illus. in color. $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
490 1 $a Texts in Computer Science, $x 1868-095X
505 0 $a 1. 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 $a This 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 2 4 $a Mathematical and Computational Engineering. $3 1139415
650 2 4 $a Optimization. $3 669174
650 2 4 $a Graph Theory. $3 786670
650 2 4 $a Operations Research/Decision Theory. $3 669176
650 1 4 $a Theory of Computation. $3 669322
650 0 $a Engineering mathematics. $3 562757
650 0 $a Applied mathematics. $3 1069907
650 0 $a Mathematical optimization. $3 527675
650 0 $a Graph theory. $3 527884
650 0 $a Decision making. $3 528319
650 0 $a Operations research. $3 573517
650 0 $a Computers. $3 565115
710 2 $a SpringerLink (Online service) $3 593884
773 0 $t Springer Nature eBook
776 0 8 $i Printed edition: $z 9783030810535
776 0 8 $i Printed edition: $z 9783030810559
776 0 8 $i Printed edition: $z 9783030810566
830 0 $a Texts in Computer Science, $x 1868-0941 $3 1254292
856 4 0 $u https://doi.org/10.1007/978-3-030-81054-2
912 $a ZDB-2-SCS
912 $a ZDB-2-SXCS
950 $a Computer Science (SpringerNature-11645)
950 $a Computer Science (R0) (SpringerNature-43710)