Probabilistic graph colouring algorithms using Zykov trees

dc.contributor.author	Lepolesa, Pikie M.	en_US
dc.date.accessioned	2024-08-14T21:03:18Z
dc.date.available	2024-08-14T21:03:18Z
dc.date.copyright	1986	en_US
dc.date.issued	1986
dc.degree.department	Department of Computer Science
dc.degree.level	Master of Science M.Sc.	en
dc.description.abstract	Let G=(V ,E) be a simple, undirected graph. A colouring of G is a mapping c : V ➔ {1,2, ... ,k}. c is a proper colouring if c(u) * c(v) for all {u,v} in E. The chromatic number of G, denoted x (G), is the smallest positive integer k for which a proper k-colouring exists. The graph colouring decision problem is to determine whether for a graph G and a positive integer k, there exists a proper colouring of G using at most k colours. A Las Vegas algorithm, i.e. a probabilistic algorithm that never lies, for the graph colouring decision problem that runs in polynomial time on almost all instances of the problem is given. Experimental results obtained with this algorithm suggest that it works well for sparse graphs. An approximation algorithm is suggested for graph colouring optimisation problem.
dc.format.extent	91 pages
dc.identifier.uri	https://hdl.handle.net/1828/18629
dc.rights	Available to the World Wide Web	en_US
dc.title	Probabilistic graph colouring algorithms using Zykov trees	en_US
dc.type	Thesis	en_US

Files

Now showing 1 - 1 of 1