5 citations · 10 across the 8 of their papers we have counts for
5 papers · 1 filter
Self-stabilizing algorithms for Connected Vertex Cover and Clique decomposition problems
François Delbot, Christian Laforest, Stephane Rovedakis
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 virtual…
Fast Self-Stabilizing Minimum Spanning Tree Construction Using Compact Nearest Common Ancestor Labeling Scheme
Lélia Blin, Shlomi Dolev, Maria Gradinariu Potop-Butucaru +1
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is bits and it converges in r…
Fast Self-Stabilizing Minimum Spanning Tree Construction
Lélia Blin, Shlomi Dolev, Maria Potop-Butucaru +1
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is bits and it converges in r…
Universal Loop-Free Super-Stabilization
Lélia Blin, Maria Potop-Butucaru, Stephane Rovedakis +1
We propose an univesal scheme to design loop-free and super-stabilizing protocols for constructing spanning trees optimizing any tree metrics (not only those that are isomorphic to…
A Superstabilizing -Approximation Algorithm for Dynamic Steiner Trees
Lélia Blin, Maria Gradinariu Potop-Butucaru, Stephane Rovedakis
In this paper we design and prove correct a fully dynamic distributed algorithm for maintaining an approximate Steiner tree that connects via a minimum-weight spanning tree a subse…