Search citation statements

Paper Sections

Select...

3

1

Citation Types

0

4

0

Publication Types

Select...

1

Relationship

1

0

Authors

Journals

(4 citation statements)

(43 reference statements)

0

4

0

“…In many of those related works, the assumption about the existence of a directed (spanning) tree in the network has to be considered as an intermediate assumption, since this structure has to be built by an underlying algorithm. Now, there are several silent selfstabilizing spanning tree constructions that are efficient in both rounds and moves, e.g., [32]. Thus, both algorithms, i.e., the one that builds the tree and the one that computes on this tree, have to be carefully composed to obtain a general composite algorithm where, the stabilization time is keeped both asymptotically optimal in rounds and polynomial in moves.…”

confidence: 99%

“…In many of those related works, the assumption about the existence of a directed (spanning) tree in the network has to be considered as an intermediate assumption, since this structure has to be built by an underlying algorithm. Now, there are several silent selfstabilizing spanning tree constructions that are efficient in both rounds and moves, e.g., [32]. Thus, both algorithms, i.e., the one that builds the tree and the one that computes on this tree, have to be carefully composed to obtain a general composite algorithm where, the stabilization time is keeped both asymptotically optimal in rounds and polynomial in moves.…”

confidence: 99%

“…To our knowledge, until now, only two works [31,32] conciliate general schemes for stabilization and efficiency in both moves and rounds. In [31], Cournier et al propose a general scheme for snap-stabilizing wave, henceforth non-silent, algorithms in arbitrary connected and rooted networks.…”

confidence: 99%