algoritma pemrograman paralel grap coloring

So basically, the Gibbs Sampling is transferred to a Graph Coloring problem, which is, how to separate a graph into groups, with the neighors are exclusive.Īfter I finished an evaluation, I will update this post 🙂 TinkerPop 3 with Java: Jones-Plassmann graph coloring: The Largest-Degree-First algorithm aims to keep the maximum value of i as small as possible throughout the computation, so that there is a better chance of using only a small number of colors.” ” A vertex with i colored neighbors will require at most color i+ 1. It is aimed to use fewer colours than the J-P one. Very similar to Jones-Plassmann, the only difference is, initially not random choosing.įirst find out the degrees.Random numbers are only used to resolve conicts between neighboring vertices having the same degree.Ĭoloring happened in an order of decreasing degree. The lowest available colour: the smallest color that has not already been assigned to a neighboring vertex.

Sequential algorithms: Largest-Degree-First, Smallest-Degree-Last can be readily parallelized.īased on the simple observation that any independent set of vertices can be colored in parallel, independent set is a set of vertices that no two of them are neighbors. But for non-planar, more colors are needed….known as an NP-Hard problem.

Algoritma pemrograman paralel grap coloring