ayushbhandarinitk / parallel_graph_coloring_using_openmp Goto Github PK

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 then a set of incorrectly colored vertices, to be recolored in the next round, is identified.Parallel speedup is achieved in part by using openmp