1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DC2017
A self-stabilizing algorithm for maximal matching in link-register model in moves
Johanne Cohen, Georges Manoussakis, Laurence Pilard +1
In the matching problem, each node maintains a pointer to one of its neighbor or to , and a maximal matching is computed when each node points either to a neighbor that itsel…
cs.DC2010★ 1 cited
A Distributed Clustering Algorithm for Dynamic Networks
Thibault Bernard, Alain Bui, Laurence Pilard +1
We propose an algorithm that builds and maintains clusters over a network subject to mobility. This algorithm is fully decentralized and makes all the different clusters grow concu…