Application of the graph coloring algorithm to the frequency assignment problem

the frequency assignment problem is introduced and solved with efficient heuristics. The problem is to assign channels to transmitters using the smallest span of freuqency band while satisfying the requested communication quality. A solution procedure which is based on Kernighan-Lin’s two way uniform partitioning procedure is developed for the k-coloring problem. The k-coloring algorithm is modified to solve the frequency assignment problem. The performance of the proposed algorithm is tested with randomly generated graphs with different number of nodes, density types and graph types. The computational result shows that the proposed algorithm gives far better solution than a well-known heuristic procedure.