graph coloring

(redirected from Coloring algorithm)

graph coloring

This article is provided by FOLDOC - Free Online Dictionary of Computing (foldoc.org)
References in periodicals archive ?
In the second phase, the coordinators implement the coloring algorithm for the interference graph.
The pseudo code of our error-tolerant coloring algorithm in shown in Algorithm 6.
Thus, to jump out of the local optimum, we combine the classical graph coloring algorithm with simulated annealing (SA) to "cool" the results.
In ant colony coloring algorithm, new colored points are selected randomly and dynamically in a reversed order according to coloring progress and degrees of points adjacent to uncolored points in order to equip the algorithm with strong ability to search overall optimal solutions.
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].
The graph-theory based spectrum allocation is an optimization problem and its optimal coloring algorithm is an NP-hard problem.
It consists in a centralized level by-level node coloring algorithm and slot stealing algorithm.
The distinguishing time complexity promotes us to design another time efficient heuristic coloring algorithm.
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