A comparison of graph colouring techniques
Loading...
Authors
Parkinson, E
Warren, PR
Issue Date
1995
Type
Article
Language
en
Keywords
Graph colouring , Heuristic algorithms , NP-hard , Random graphs
Alternative Title
Abstract
Many scheduling problems can be modelled as graph colouring problems. This paper gives a survey of heuristic algorithms used to colour graphs by describing a number of such algorithms found in the literature using an uniformn otation. We then compare these algorithms in terms of the time used and the quality of the colourings produced, on the basis of empirical results.
Description
Citation
Parkinson E & Warren PR (1995) A comparison of graph colouring techniques. South African Computer Journal, Number 14, 1995
Publisher
South African Computer Society (SAICSIT)
License
Journal
Volume
Issue
PubMed ID
DOI
ISSN
2313-7835