By R. M. R. Lewis

ISBN-10: 3319257307

ISBN-13: 9783319257303

This ebook treats graph colouring as an algorithmic challenge, with a powerful emphasis on useful functions. the writer describes and analyses a number of the best-known algorithms for colouring arbitrary graphs, targeting even if those heuristics delivers optimum strategies sometimes; how they practice on graphs the place the chromatic quantity is unknown; and whether or not they can produce higher ideas than different algorithms for particular types of graphs, and why.

The introductory chapters clarify graph colouring, and boundaries and positive algorithms. the writer then indicates how complex, glossy suggestions will be utilized to vintage real-world operational examine difficulties reminiscent of seating plans, activities scheduling, and college timetabling. He comprises many examples, feedback for extra examining, and ancient notes, and the ebook is supplemented by way of an internet site with an internet suite of downloadable code.

The booklet can be of worth to researchers, graduate scholars, and practitioners within the parts of operations examine, theoretical laptop technology, optimization, and computational intelligence. The reader must have trouble-free wisdom of units, matrices, and enumerative combinatorics.