FPGA-based implementation of graph colouring algorithms

Abstract

The chapter suggests an FPGA-based implementation of graph colouring algorithms formulated over ternary matrices. First, software models (described in C++) and the respective hardware circuits (synthesised from Handel-C specifications) for getting exact solutions are discussed, analysed and compared. Then it is shown that the exact algorithm can serve as a base for a number of approximate algorithms, which permit to improve incrementally the results until some predefined criteria are satisfied. Characteristics and capabilities of the approximate algorithms are also examined. © 2007 Springer-Verlag Berlin Heidelberg.