All Title Author
Keywords Abstract

Graph colouring algorithms

Full-Text   Cite this paper   Add to My Lib


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.


comments powered by Disqus

Contact Us


微信:OALib Journal