Distributed graph coloring: an approach based on the calling behavior of Japanese tree frogs |
| |
Authors: | Hugo Hernández and Christian Blum |
| |
Affiliation: | (1) ALBCOM Research Group, Universitat Polit?cnica de Catalunya, Barcelona, Spain |
| |
Abstract: | Graph coloring—also known as vertex coloring—considers the problem of assigning colors to the nodes of a graph such that adjacent nodes do not share the same color. The optimization version of the problem concerns the minimization of the number of colors used. In this paper we deal with the problem of finding valid graphs colorings in a distributed way, that is, by means of an algorithm that only uses local information for deciding the color of the nodes. The algorithm proposed in this paper is inspired by the calling behavior of Japanese tree frogs. Male frogs use their calls to attract females. Interestingly, groups of males that are located near each other desynchronize their calls. This is because female frogs are only able to correctly localize male frogs when their calls are not too close in time. The proposed algorithm makes use of this desynchronization behavior for the assignment of different colors to neighboring nodes. We experimentally show that our algorithm is very competitive with the current state of the art, using different sets of problem instances and comparing to one of the most competitive algorithms from the literature. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|