MARC details
000 -LEADER |
fixed length control field |
02098 a2200241 4500 |
003 - CONTROL NUMBER IDENTIFIER |
control field |
ISI Library, Kolkata |
005 - DATE AND TIME OF LATEST TRANSACTION |
control field |
20250616115123.0 |
008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION |
fixed length control field |
250520b |||||||| |||| 00| 0 eng d |
020 ## - INTERNATIONAL STANDARD BOOK NUMBER |
International Standard Book Number |
9783030810566 |
040 ## - CATALOGING SOURCE |
Original cataloging agency |
ISI Library |
Language of cataloging |
English |
082 04 - DEWEY DECIMAL CLASSIFICATION NUMBER |
Edition number |
23rd |
Classification number |
511.56 |
Item number |
L673 |
100 1# - MAIN ENTRY--PERSONAL NAME |
Personal name |
Lewis, R. M. R |
Relator term |
author |
245 10 - TITLE STATEMENT |
Title |
Guide to Graph Colouring: |
Remainder of title |
algorithms and applications/ |
Statement of responsibility, etc |
R.M.R. Lewis |
260 ## - PUBLICATION, DISTRIBUTION, ETC. (IMPRINT) |
Place of publication, distribution, etc |
Switzerland: |
Name of publisher, distributor, etc |
Springer, |
Date of publication, distribution, etc |
2021 |
300 ## - PHYSICAL DESCRIPTION |
Extent |
xiv, 303 pages; |
Other physical details |
diag, |
Dimensions |
23 cm. |
490 0# - SERIES STATEMENT |
Series statement |
Texts in Computer Science |
504 ## - BIBLIOGRAPHY, ETC. NOTE |
Bibliography, etc |
Includes bibliography and index |
505 0# - FORMATTED CONTENTS NOTE |
Formatted contents note |
Introduction to graph colouring -- Problem complexity -- Bounds and constructive heuristics -- Advanced techniques for graph colouring -- Algorithm case studies -- Applications and extensions -- Designing seating plans -- Designing sports leagues -- Designing university timetables |
520 ## - SUMMARY, ETC. |
Summary, etc |
This textbook 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 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.<br/>The introductory chapters explain graph colouring, complexity theory, bounds and constructive algorithms. The author 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. He includes many examples, suggestions for further reading, and historical notes, and the book is supplemented by an online suite of downloadable code.<br/>The book is of value to researchers, graduate students, and practitioners in the areas of operations research, theoretical computer science, optimization, and computational intelligence. |
650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Mathematics |
650 #4 - SUBJECT ADDED ENTRY--TOPICAL TERM |
Topical term or geographic name as entry element |
Graph Colouring |
942 ## - ADDED ENTRY ELEMENTS (KOHA) |
Koha item type |
Books |
Source of classification or shelving scheme |
Dewey Decimal Classification |