Wireless sensor networks benefit from communication protocols that reduce power
requirements by avoiding frame collision. Time Division Media Access methods schedule …

Self-stabilizing algorithms for optimization problems can often be solved more easily using
the distance-two model in which each vertex can instantly see the state information of all …

Twitter has become a target platform on which spammers spread large amounts of harmful
information. These malicious spamming activities have seriously threatened normal users' …

A distributed system is self-stabilizing if, regardless of its initial state, the system is
guaranteed to reach a legitimate (ie, correct) state in finite time. In 2007, Turau proposed the …

This paper considers distributed vertex-coloring in broadcast/receive networks suffering from
conflicts and collisions.(A collision occurs when, during the same round, messages are sent …

The problem of assigning frequencies to processes so as to avoid interference can in many
instances be modeled as a graph coloring problem on the processor graph where no two …

Many graph problems seem to require knowledge that extends beyond the immediate
neighbors of a node. The usual self-stabilizing model only allows for nodes to make …

Graph alliances are recently developed global properties of any symmetric graph. Our
purpose in the present paper is to design self-stabilizing fault tolerant distributed algorithms …

We propose the first polynomial self-stabilizing distributed algorithm for the minimal total
dominating set problem in an arbitrary graph. Then, we generalize the proposed algorithm …

In self-stabilization, each node has a local view of the distributed network system, in a finite
amount of time the system converges to a global setup with desired property, in this case …