Advanced

Graph colouring algorithms

Husfeldt, Thore LU (2015) In Topics in Chromatic Graph Theory p.277-303
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.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Chapter in Book/Report/Conference proceeding
publication status
published
subject
in
Topics in Chromatic Graph Theory
editor
Lowell B., Beineke; Robin J., Wilson; and
pages
277 - 303
publisher
Cambridge University Press
external identifiers
  • scopus:84952684504
ISBN
9781107033504
project
Exact algorithms
language
English
LU publication?
yes
id
41504781-f60b-4ed6-b700-0c31ce36f840 (old id 5212163)
alternative location
http://www.cambridge.org/us/academic/subjects/mathematics/discrete-mathematics-information-theory-and-coding/topics-chromatic-graph-theory
date added to LUP
2015-03-30 13:17:17
date last changed
2017-09-24 04:49:54
@inbook{41504781-f60b-4ed6-b700-0c31ce36f840,
  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.},
  author       = {Husfeldt, Thore},
  editor       = {Lowell B., Beineke and Robin J., Wilson},
  isbn         = {9781107033504},
  language     = {eng},
  pages        = {277--303},
  publisher    = {Cambridge University Press},
  series       = {Topics in Chromatic Graph Theory},
  title        = {Graph colouring algorithms},
  year         = {2015},
}