English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

Graph coloring, also known as vertex coloring, considers the problem ofassigning colors to the nodes of a graph such that adjacent nodes do not sharethe same color. The optimization version of the problem concerns theminimization of the number of used colors. In this paper we deal with theproblem of finding valid colorings of graphs in a distributed way, that is, bymeans of an algorithm that only uses local information for deciding the colorof the nodes. Such algorithms prescind from any central control. Due to thefact that quite a few practical applications require to find colorings in adistributed way, the interest in distributed algorithms for graph coloring hasbeen growing during the last decade. As an example consider wireless ad-hoc andsensor networks, where tasks such as the assignment of frequencies or theassignment of TDMA slots are strongly related to graph coloring.  The algorithm proposed in this paper is inspired by the calling behavior ofJapanese tree frogs. Male frogs use their calls to attract females.Interestingly, groups of males that are located nearby each other desynchronizetheir calls. This is because female frogs are only able to correctly localizethe male frogs when their calls are not too close in time. We experimentallyshow 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 mostcompetitive algorithms from the literature.

Distributed Graph Coloring: An Approach Based on the Calling Behavior of Japanese Tree Frogs