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 ColouringAlgorithm Case Studies

A Guide to Graph Colouring: Algorithm Case Studies [In this chapter we present detailed descriptions of six high-performance algorithms for the graph colouring problem. Implementations of each of these can be found in the online suite of graph colouring algorithms described in Section 1.6.1 and Appendix A.1. In Section 4.2 onwards we then compare the performance of these algorithms over a wide range of graphs in order to gauge their relative strengths and weaknesses.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

A Guide to Graph ColouringAlgorithm Case Studies

Download PDF
30 pages

Loading next page...
 
/lp/springer-journals/a-guide-to-graph-colouring-algorithm-case-studies-KRyCat0Dnm
Publisher
Springer International Publishing
Copyright
© Springer International Publishing Switzerland 2016
ISBN
978-3-319-25728-0
Pages
79 –109
DOI
10.1007/978-3-319-25730-3_4
Publisher site
See Chapter on Publisher Site

Abstract

[In this chapter we present detailed descriptions of six high-performance algorithms for the graph colouring problem. Implementations of each of these can be found in the online suite of graph colouring algorithms described in Section 1.6.1 and Appendix A.1. In Section 4.2 onwards we then compare the performance of these algorithms over a wide range of graphs in order to gauge their relative strengths and weaknesses.]

Published: Oct 27, 2015

Keywords: Local Search; Random Graph; Tabu List; Vertex Degree; Colour Classis

There are no references for this article.