東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

A guide to graph colouring = algorit...

Lewis, R.M.R.

FindBook

Google Book

Amazon

博客來

A guide to graph colouring = algorithms and applications /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	A guide to graph colouring/ by R.M.R. Lewis.
其他題名:	algorithms and applications /
作者:	Lewis, R.M.R.
出版者:	Cham :Springer International Publishing : : 2016.,
面頁冊數:	xiv, 253 p. :ill., digital ;24 cm.
內容註:	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.
Contained By:	Springer eBooks
標題:	Charts, diagrams, etc. -
電子資源:	http://dx.doi.org/10.1007/978-3-319-25730-3
ISBN:	9783319257303$q(electronic bk.)

A guide to graph colouring = algorithms and applications /
Lewis, R.M.R.

A guide to graph colouringalgorithms and applications /[electronic resource] :by R.M.R. Lewis. - Cham :Springer International Publishing :2016. - xiv, 253 p. :ill., digital ;24 cm.

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.

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.

ISBN: 9783319257303$q(electronic bk.)

Standard No.: 10.1007/978-3-319-25730-3doiSubjects--Topical Terms:

1242518
Charts, diagrams, etc.

LC Class. No.: QA90

Dewey Class. No.: 511.5

A guide to graph colouring = algorithms and applications /
LDR:02431nmm a2200313 a 4500 001 2028862
003 DE-He213
005 20160725150855.0
006 m d
007 cr nn 008maaau
008 160908s2016 gw s 0 eng d
020 $a 9783319257303$q(electronic bk.)
020 $a 9783319257280$q(paper)
024 7 $a 10.1007/978-3-319-25730-3 $2 doi
035 $a 978-3-319-25730-3
040 $a GP $c GP
041 0 $a eng
050 4 $a QA90
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
082 0 4 $a 511.5 $2 23
090 $a QA90 $b .L673 2016
100 1 $a Lewis, R.M.R. $3 2179505
245 1 2 $a A guide to graph colouring $h [electronic resource] : $b algorithms and applications / $c by R.M.R. Lewis.
260 $a Cham : $b Springer International Publishing : $b Imprint: Springer, $c 2016.
300 $a xiv, 253 p. : $b ill., digital ; $c 24 cm.
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 Charts, diagrams, etc. $3 1242518
650 0 $a Graphic methods. $3 636683
650 0 $a Visual communication in science. $3 2179506
650 0 $a Scientific illustration. $3 685964
650 1 4 $a Computer Science. $3 626642
650 2 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Optimization. $3 891104
650 2 4 $a Operation Research/Decision Theory. $3 1620900
650 2 4 $a Appl.Mathematics/Computational Methods of Engineering. $3 890892
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-3-319-25730-3
950 $a Computer Science (Springer-11645)