000752263 000__ 03237cam\a2200481Ii\4500
000752263 001__ 752263
000752263 005__ 20230306141405.0
000752263 006__ m\\\\\o\\d\\\\\\\\
000752263 007__ cr\cn\nnnunnun
000752263 008__ 151029t20162016sz\a\\\\ob\\\\001\0\eng\d
000752263 019__ $$a936281188
000752263 020__ $$a9783319257303$$q(electronic book)
000752263 020__ $$a3319257307$$q(electronic book)
000752263 020__ $$z9783319257280
000752263 0247_ $$a10.1007/978-3-319-25730-3$$2doi
000752263 035__ $$aSP(OCoLC)ocn927140677
000752263 035__ $$aSP(OCoLC)927140677$$z(OCoLC)936281188
000752263 040__ $$aN$T$$beng$$erda$$epn$$cN$T$$dN$T$$dYDXCP$$dIDEBK$$dNUI$$dOCLCF$$dAZU$$dCOO$$dGW5XE$$dCDX$$dGZM$$dEBLCP
000752263 049__ $$aISEA
000752263 050_4 $$aQA90
000752263 08204 $$a511.5$$223
000752263 1001_ $$aLewis, Rhyd M. R.,$$eauthor.
000752263 24512 $$aA guide to graph colouring$$h[electronic resource] :$$balgorithms and applications /$$cR.M.R. Lewis.
000752263 264_1 $$aCham :$$bSpringer,$$c[2016].
000752263 264_4 $$c©2016
000752263 300__ $$a1 online resource (xiv, 253 pages) :$$billustrations.
000752263 336__ $$atext$$btxt$$2rdacontent
000752263 337__ $$acomputer$$bc$$2rdamedia
000752263 338__ $$aonline resource$$bcr$$2rdacarrier
000752263 504__ $$aIncludes bibliographical references (pages 239-249). and index.
000752263 5050_ $$aIntroduction 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.
000752263 506__ $$aAccess limited to authorized users.
000752263 520__ $$aThis 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.
000752263 588__ $$aOnline resource; title from PDF title page (viewed November 4, 2015)
000752263 650_0 $$aCharts, diagrams, etc.
000752263 650_0 $$aGraphic methods.
000752263 650_0 $$aVisual communication in science.
000752263 650_0 $$aScientific illustration.
000752263 77608 $$iPrint version:$$z9783319257280
000752263 852__ $$bebk
000752263 85640 $$3SpringerLink$$uhttps://univsouthin.idm.oclc.org/login?url=http://link.springer.com/10.1007/978-3-319-25730-3$$zOnline Access$$91397441.1
000752263 909CO $$ooai:library.usi.edu:752263$$pGLOBAL_SET
000752263 980__ $$aEBOOK
000752263 980__ $$aBIB
000752263 982__ $$aEbook
000752263 983__ $$aOnline
000752263 994__ $$a92$$bISE