Graph Colouring Algorithms

Publikation: Konference artikel i Proceeding eller bog/rapport kapitelBidrag til bog/antologiForskningpeer review

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.
OriginalsprogEngelsk
TitelTopics in Chromatic Graph Theory
RedaktørerLowell W. Beineke, Robin J. Wilson
ForlagCambridge University Press
Publikationsdatomaj 2015
Sider277-303
Kapitel13
ISBN (Trykt)987-1-107-3350-4
StatusUdgivet - maj 2015
NavnEncyclopedia of Mathematics and Its Applications
Nummer156
ISSN0953-4806

Fingeraftryk

Dyk ned i forskningsemnerne om 'Graph Colouring Algorithms'. Sammen danner de et unikt fingeraftryk.

Citationsformater