Efficiency of graph coloring algorithms in optimal frequency assignment tasks

摘要

The comparative analysis of accuracy and speed characteristics of optimal frequency assignment methods, using accurate and approximate graph coloring algorithms, is performed. The analysis showed that these algorithms are practically equivalent in the solution accuracy. The accurate algorithm may be used in groups up to 30...80 radio electronic systems while the approximate one - up to 1000 and more systems in it's speed characteristics.