Parallel algorithm to Solve the Graph Coloring Problem (Akshay Singh)

The included source code implements a variation of the Graph Coloring decision problem, as described in the included problem description text file. The application uses a simple brute force test of coloring the input graph with a given number of colors. If no such coloring is possible, the number of colors is incremented and the brute force search is executed again with the new number of possible colors. The actual attempts to assign colors to nodes are done in parallel through a task pool mechanism implemented with POSIX threads. The code was intended for Linux OS and includes a makefile to build the application.

DISCLAIMER: This code is provided by the author as a submitted contest entry, and is intended for educational use only. The code is not guaranteed to solve all instances of the input data sets and may require modifications to work in your own specific environment.

Unter der Lizenz Creative Commons License stehen Downloads zur Verfügung. Jetzt herunterladen
Nähere Informationen zur Compiler-Optimierung finden Sie in unserem Optimierungshinweis.