Graph Colouring Algorithms
Research Output:
Conference Article in Proceeding or Book/Report chapter
Book chapter
Peer-reviewPublication Information
Output type
Research Output:
Conference Article in Proceeding or Book/Report chapter
Book chapter
Peer-reviewOriginal language
EnglishPages from-to (Number of pages)
Pages 277-303Publication milestones
- Published - 05/2015
Publication status
Published - 05/2015
Publisher
Cambridge University PressBook series
- Book series name: Encyclopedia of Mathematics and Its Applications
Series number: 156
ISSN: 0953-4806
ISBN (Print)
987-1-107-3350-4Chapter Number
13Publication IDs
- Scopus: 84952684504
Host publication title
Topics in Chromatic Graph TheoryHost publication editors
- Lowell W. Beineke
- Robin J. Wilson
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.
Publication metrics
PlumX
Citations
13
Captures
59