graph coloring

(redirected from Coloring algorithm)
Also found in: Wikipedia.

graph coloring

References in periodicals archive ?
The structured probing approximations were obtained with the distance-2 balanced coloring algorithm of [8].
Various graph coloring algorithms are detailed in Section 5.
In 1994 Alon and Kahale exhibited a coloring algorithm and proved its usefulness for finding a k-coloring of graphs drawn from a certain planted-solution distribution over k-colorable graphs.
Specifically, we show that Alon and Kahale's coloring algorithm implicitly contains Gallager's decoding algorithm, thus asserting an interesting relation between the two problems--coloring and decoding.
Thus, in turn, Alon and Kahale's coloring algorithm (interpreted in Gallager's spirit) inspires a simple decoding algorithm for noisy codewords with error rate by some constat smaller than the code's rate.
From here on we will refer to Gallager's decoding algorithm by Gallager and to Alon and Kahale's coloring algorithm by Alon-Kahale.
As opposed to results in [3], the coloring algorithm presented here successfully colors series-parallel graphs with at most h(G) colors even if the ratio between maximal and minimal edge weights exceeds 2.
G], V) for storing the graph during the course of the coloring algorithm.
The last section is devoted to estimating the speed of the coloring algorithm.
Section 1 is devoted to algorithms and infrastructures, with chapters on topics such as self-stabilizing graph coloring algorithms, and distributed service programming and interoperability.
These coloring algorithms have order p complexity and are potentially problematic for very large numbers of processors.
For example, parallel graph coloring algorithms [8] provide a significantly better probabilistic performance bound than the deterministic algorithms described here.