Graph colouring algorithms
Data Structures and Algorithms
2015-05-22 v1
Abstract
This chapter presents an introduction to graph colouring algorithms. The focus is on vertex-colouring algorithms that work for general classes of graphs with worst-case performance guarantees in a sequential model of computation. The presentation aims to demonstrate the breadth of available techniques and is organized by algorithmic paradigm.
Cite
@article{arxiv.1505.05825,
title = {Graph colouring algorithms},
author = {Thore Husfeldt},
journal= {arXiv preprint arXiv:1505.05825},
year = {2015}
}
Comments
Thore Husfeldt, Graph colouring algorithms. Chapter 13 of Topics in Chromatic Graph Theory, L. W. Beineke and Robin J. Wilson (eds.), Encyclopedia of Mathematics and its Applications 156, Cambridge University Press, ISBN 978-1-107-03350-4, 2015, pp. 277-303