國立高雄大學圖資館 |

Language: English

Back

Guide to graph colouringalgorithms a...

Lewis, R. M. R.

Guide to graph colouringalgorithms and applications /

Record Type:	Electronic resources : Monograph/item
Title/Author:	Guide to graph colouringby R. M. R. Lewis.
Reminder of title:	algorithms and applications /
Author:	Lewis, R. M. R.
Published:	Cham :Springer International Publishing :2021.
Description:	xiv, 304 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
Subject:	Graph coloring.
Online resource:	https://doi.org/10.1007/978-3-030-81054-2
ISBN:	9783030810542$q(electronic bk.)

Guide to graph colouringalgorithms and applications /
Lewis, R. M. R.

Guide to graph colouringalgorithms and applications /[electronic resource] :by R. M. R. Lewis. - Second edition. - Cham :Springer International Publishing :2021. - xiv, 304 p. :ill. (some col.), digital ;24 cm. - 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$q(electronic bk.)

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

487342
Graph coloring.

LC Class. No.: QA166.247 / .L38 2021

Dewey Class. No.: 511.56

Guide to graph colouringalgorithms and applications /
LDR:03138nmm a2200361 a 4500 001 610425
003 DE-He213
005 20211007104716.0
006 m d
007 cr nn 008maaau
008 220330s2021 sz s 0 eng d
020 $a 9783030810542$q(electronic bk.)
020 $a 9783030810535$q(paper)
024 7 $a 10.1007/978-3-030-81054-2 $2 doi
035 $a 978-3-030-81054-2
040 $a GP $c GP
041 0 $a eng
050 4 $a QA166.247 $b .L38 2021
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 511.56 $2 23
090 $a QA166.247 $b .L675 2021
100 1 $a Lewis, R. M. R. $3 908485
245 1 0 $a Guide to graph colouring $h [electronic resource] : $b algorithms and applications / $c by R. M. R. Lewis.
250 $a Second edition.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2021.
300 $a xiv, 304 p. : $b ill. (some col.), digital ; $c 24 cm.
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 0 $a Graph coloring. $3 487342
650 1 4 $a Theory of Computation. $3 274475
650 2 4 $a Operations Research/Decision Theory. $3 273963
650 2 4 $a Graph Theory. $3 522732
650 2 4 $a Optimization. $3 274084
650 2 4 $a Mathematical and Computational Engineering. $3 775095
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Texts in computer science. $3 559643
856 4 0 $u https://doi.org/10.1007/978-3-030-81054-2
950 $a Computer Science (SpringerNature-11645)