graph coloring

(redirected from Coloring algorithm)

graph coloring

References in periodicals archive ?
In wireless networks, the transmission range is not same as the interference range and hidden/exposed terminal problems can occur, so a new link coloring algorithm is needed[16].
It consists in a centralized level by-level node coloring algorithm and slot stealing algorithm.
To prevent collisions among the reservation signals, we apply a vertex coloring algorithm to our slot allocation.
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.
1993], and compare the resulting code with the code obtained from an aggressive graph coloring algorithm that performs iterated register coalescing [George and Appel 1996].
An algorithm for semicoloring leads naturally to a coloring algorithm as shown by the following lemma.
A Subsect Coloring Algorithm and Its Applications to Computer Graphics
Definition 1: For an undirected graph G, conventional edge coloring algorithm assigns colors to the edges of G in such a way that no two adjacent edges are assigned with same color.
We will apply an algorithmic version of the weak hypergraph regularity lemma which was established by Czygrinow and Rodl [2] and in a slightly adjusted form for our needs, it will be used here to analyze our coloring algorithm Color(H), that will be introduced in the next section:
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.
The structured probing approximations were obtained with the distance-2 balanced coloring algorithm of [8].