In the self-stabilizing model we consider a connected system of autonomous asynchronous nodes, each of which has only local information about the system. Regardless of the initial state, the systemâ€¦ (More)

Distributed Greedy Coloring is an interesting and intuitive variation of the standard Coloring problem. Given an order among the colors, a coloring is said to be greedy if there does not exist aâ€¦ (More)

In the paper we present a new distributed algorithm for coloring the vertices of a graph. A practical simulation shows that this algorithm performs much better then a naive distributed algorithm.

In the paper we consider distributed algorithms for greedy graph coloring. For the largest-first (LF) approach, we propose a new distributed algorithm which is shown to color a graph in an expectedâ€¦ (More)

International Symposium on Parallel Computing inâ€¦

2006

When performing an algorithm in the self-stabilizing model, a distributed system must achieve a desirable global state regardless of the initial state, whereas each node has only local informationâ€¦ (More)

In this work we consider the edge searching problem for vertex-weighted graphs with arbitrarily fast and invisible fugitive. The weight function $${\omega }$$ Ï‰ provides for each vertex $$v$$ v theâ€¦ (More)