Timetabling Problem
-
Updated
Jan 8, 2018 - C
Timetabling Problem
In large-scale parallel applications a graph coloring is often carried out to schedule computational tasks.Graph coloring problem is to assign colors to certain elements of a graph subject to certain constraints. The algorithm operates in an iterative fashion, in each round vertices are speculatively colored based on limited information, and the…
C codes for standard algorithms
Add a description, image, and links to the graphcoloring topic page so that developers can more easily learn about it.
To associate your repository with the graphcoloring topic, visit your repo's landing page and select "manage topics."