-
Tolerating Transient, Permanent, and Intermittent Failures
A distributed system is a system composed of a set of autonomous computation units endowed with communication abilities in order to solve a global task. This model is... -
Loop-Free Super-Stabilizing Spanning Tree Construction
International audience -
Poisson-Voronoi Spanning Trees with Applications to the Optimization of Commu...
We define a family of random trees in the plane. Their nodes of level $k, k=0\thru m$ are the points of a homogeneous Poisson point process $\Pi_k$, whereas their arcs... -
New heuristics for two bounded-degree spanning tree problems
International audience -
Scheduling Associative Reductions with Homogeneous Costs when Overlapping Com...
Reduction is a core operation in parallel computing. Optimizing its cost has a high potential impact on the application execution time, particularly in MPI and... -
Dual path communications over multiple spanning trees for networked control s...
International audience -
On backbone coloring of graphs
International audience -
Tree probability distribution : applictaion to skin detection in color images
Skin detection or segmentation is considered as an important preliminary process in a number of existing systems ranging over face detection, filtering Internet... -
Contribution to the study of Markov loops.
We are interested in Markov laces defined in the framework of the theory of Markov chains in continuous time on a discrete state space. This particular subject has... -
Self-stabilizing algorithms for spanning tree construction and for the manage...
In the context of large-scale networks, the consideration of faults is an evident necessity. This document is focussing on the self-stabilizing approach which aims at... -
A new self-stabilizing minimum spanning tree construction with loop-free prop...
International audience -
The complexity of Bottleneck Labeled Graph Problems
In the present paper, we study bottleneck labeled optimization problems arising in the context of graph theory. This long-established model partitions the set of edges... -
Edge-Removal and Non-Crossing Configurations in Geometric Graphs
Graphs and Algorithms
