A comparison of graph colouring techniques

dc.contributor.author	Parkinson, E
dc.contributor.author	Warren, PR
dc.date.accessioned	2018-05-31T06:13:00Z
dc.date.available	2018-05-31T06:13:00Z
dc.date.issued	1995
dc.identifier.citation	Parkinson E & Warren PR (1995) A comparison of graph colouring techniques. South African Computer Journal, Number 14, 1995	en
dc.identifier.issn	2313-7835
dc.identifier.uri	http://hdl.handle.net/10500/24180
dc.description.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.	en
dc.language.iso	en	en
dc.publisher	South African Computer Society (SAICSIT)	en
dc.subject	Graph colouring	en
dc.subject	Heuristic algorithms	en
dc.subject	NP-hard	en
dc.subject	Random graphs	en
dc.title	A comparison of graph colouring techniques	en
dc.type	Article	en