SAT Algorithms for Colouring Some Special Classes of Graphs: Some Theoretical and Experimental Results
Sriyankar Acharyya · Journal on Satisfiability Boolean Modeling and Computation · 2007
The local search algorithm GSAT is based on the notion of Satisfiability. It has been used successfully for colouring graphs, solving instances of the 3SAT problem, planning blocks world exercises, and other applications. The runtime performance of G