Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Guide to Graph ColouringAdvanced Techniques for Graph Colouring

A Guide to Graph Colouring: Advanced Techniques for Graph Colouring [In this chapter we now review many of the algorithmic techniques that can be (and have been) used for the graph colouring problem. The intention is to give the reader an overview of the different strategies available, including both exact and inexact methods. As we will see, a variety of different approaches are available, including backtracking algorithms, integer programming, evolutionary algorithms, neighbourhood search algorithms, and other metaheuristics. Full descriptions of these different techniques are provided as they arise in the text.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Guide to Graph ColouringAdvanced Techniques for Graph Colouring

Download PDF
22 pages

Loading next page...
 
/lp/springer-journals/a-guide-to-graph-colouring-advanced-techniques-for-graph-colouring-lryFasCD0Y
Publisher
Springer International Publishing
Copyright
© Springer International Publishing Switzerland 2016
ISBN
978-3-319-25728-0
Pages
55 –77
DOI
10.1007/978-3-319-25730-3_3
Publisher site
See Chapter on Publisher Site

Abstract

[In this chapter we now review many of the algorithmic techniques that can be (and have been) used for the graph colouring problem. The intention is to give the reader an overview of the different strategies available, including both exact and inexact methods. As we will see, a variety of different approaches are available, including backtracking algorithms, integer programming, evolutionary algorithms, neighbourhood search algorithms, and other metaheuristics. Full descriptions of these different techniques are provided as they arise in the text.]

Published: Oct 27, 2015

Keywords: Solution Space; Tabu Search; Greedy Algorithm; Chromatic Number; Graph Colouring

There are no references for this article.