UCL logo

UCL Discovery

UCL home » Library Services » Electronic resources » UCL Discovery

Analysis of the mean field annealing algorithm for graph colouring

Shawe-Taylor, J; Zerovnik, J; (1995) Analysis of the mean field annealing algorithm for graph colouring. Journal of artificial neural networks , 2 (4) pp. 329-340.

Full text not available from this repository.

Abstract

The operation of the MFA algorithm for a Generalised Boltzmann Machine is characterised by the definition of an appropriate energy function which the algorithm attempts to minimise. The case of graph colouring is studied in detail and a relationship between the critical temperature of the MFA algorithm and the minimal eigenvalue of the graph to be coloured is demonstrated. Experimental results are presented which indicate that in both a massively parallel implementation and in a sequential implementation the algorithm outperforms the Petford and Welsh algorithm on random graphs. The experiments, however, suggest that the algorithm is less effective for graphs that are difficult to colour.

Type: Article
Title: Analysis of the mean field annealing algorithm for graph colouring
UCL classification: UCL > Provost and Vice Provost Offices
UCL > Provost and Vice Provost Offices > UCL BEAMS
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science
UCL > Provost and Vice Provost Offices > UCL BEAMS > Faculty of Engineering Science > Dept of Computer Science
URI: http://discovery.ucl.ac.uk/id/eprint/79160
Downloads since deposit
0Downloads
Download activity - last month
Download activity - last 12 months
Downloads by country - last 12 months

Archive Staff Only

View Item View Item