We propose a general framework to build certified proofs of distributed self-stabilizing
algorithms with the proof assistant Coq. We first define in Coq the locally shared memory …

In this paper, we give a silent self-stabilizing algorithm for constructing a k-clustering of any
asynchronous connected network with unique IDs. Our algorithm stabilizes in O (n) rounds …

We consider the minimal k-grou** problem: given a graph G=(V, E) and a constant k,
partition G into subgraphs of diameter no greater than k, such that the union of any two …

With the rise of social media, misinformation has significant negative effects on the decision-
making of individuals, organizations and communities within society. Identifying and …

While efficient algorithms for finding minimal distance-k dominating sets exist, finding
minimum such sets is NP-hard even for bipartite graphs. This paper presents a distributed …

In many wireless networks, there is no fixed physical backbone nor centralized network
management. The nodes of such a network have to self-organize in order to maintain a …

For an integer k≥ 1, a (distance) k-dominating set of a connected graph G is a set S of
vertices of G such that every vertex of V (G)∖ S is at distance at most k from some vertex of S …

We propose a fast, silent self-stabilizing protocol building a distance-k independent
dominating set, named FID. The convergence of the protocol FID is established for any …

We propose a memory efficient self-stabilizing protocol building distance-k independent
dominating sets. A distance-k independent dominating set is a distance-k independent set …

Finding the maximum independent set is a fundamental NP-hard problem in graph theory.
Recent studies have paid much attention to designing efficient algorithms that find a …