-
Fast Self-Stabilizing Minimum Spanning Tree Construction Using Compact Neares...
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is $O(\log^2n)$ bits and it converges... -
Labeling Schemes with Forbidden-Sets
International audience -
Connectivity Labeling Scheme for Graphs on Surface
International audience -
Progress and Challenges for Labeling Schemes
International audience
