語系:
繁體中文
English
說明(常見問題)
登入
回首頁
切換:
標籤
|
MARC模式
|
ISBD
A Guide to Graph Colouring = Algorit...
~
Lewis, R.M.R.
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.
面頁冊數:
XIV, 253 p.online resource. :
Contained By:
Springer Nature eBook
標題:
Algorithms. -
電子資源:
https://doi.org/10.1007/978-3-319-25730-3
ISBN:
9783319257303
A Guide to Graph Colouring = Algorithms and Applications /
Lewis, R.M.R.
A Guide to Graph Colouring
Algorithms and Applications /[electronic resource] :by R.M.R. Lewis. - 1st ed. 2016. - XIV, 253 p.online resource.
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
Standard No.: 10.1007/978-3-319-25730-3doiSubjects--Topical Terms:
527865
Algorithms.
LC Class. No.: QA76.9.A43
Dewey Class. No.: 005.1
A Guide to Graph Colouring = Algorithms and Applications /
LDR
:02825nam a22003975i 4500
001
978597
003
DE-He213
005
20200703134559.0
007
cr nn 008mamaa
008
201211s2016 gw | 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
035
$a
978-3-319-25730-3
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
005.1
$2
23
100
1
$a
Lewis, R.M.R.
$4
aut
$4
http://id.loc.gov/vocabulary/relators/aut
$3
1102249
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.
$3
527865
650
0
$a
Mathematical optimization.
$3
527675
650
0
$a
Operations research.
$3
573517
650
0
$a
Decision making.
$3
528319
650
0
$a
Applied mathematics.
$3
1069907
650
0
$a
Engineering mathematics.
$3
562757
650
1 4
$a
Algorithm Analysis and Problem Complexity.
$3
593923
650
2 4
$a
Optimization.
$3
669174
650
2 4
$a
Operations Research/Decision Theory.
$3
669176
650
2 4
$a
Mathematical and Computational Engineering.
$3
1139415
710
2
$a
SpringerLink (Online service)
$3
593884
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.org/10.1007/978-3-319-25730-3
912
$a
ZDB-2-SCS
912
$a
ZDB-2-SXCS
950
$a
Computer Science (SpringerNature-11645)
950
$a
Computer Science (R0) (SpringerNature-43710)
筆 0 讀者評論
多媒體
評論
新增評論
分享你的心得
Export
取書館別
處理中
...
變更密碼[密碼必須為2種組合(英文和數字)及長度為10碼以上]
登入