

![0_image_0.png](0_image_0.png)

As shown in Table 5, the three algorithms achieve equal results in 7 out of 14 cases. Only in one case (see 1hexagon-tess.col) Finocchi is slightly better than the FrogSim algorithms due to the fact that it achieves an optimal coloring in all 100 applications. In the remaining cases both FrogSim and FrogSim obtain better results than Finocchi. Moreover, **it is remarkable**
that both FrogSim **and FrogSim obtain for 12 of the 14 instances optimal solutions. The** difference between FrogSim **and FrogSim is again to be found in the fact that FrogSim is**
more robust, which is indicated by a better average solution **quality.**
Figure 11 graphically summarizes the results as in the previous subsections. Again this graphical way of presenting the results helps to show the improvement of FrogSim over FrogSim **in terms of the average solution quality.**

## 5 Conclusions And Future Work

Graph coloring is a classical problem of modern mathematics **with more than 150 years** of history. The problem has been extensively studied in theory and practice. However, its connection to problems that have arisen with the proliferation of wireless networks has sparked