Search citation statements

Paper Sections

Select...

2

1

Citation Types

0

3

0

Year Published

2015

2020

Publication Types

Select...

1

1

1

Relationship

1

2

Authors

Journals

(3 citation statements)

(13 reference statements)

0

3

0

“…There is a huge literature on the self-stabilizing construction of various kinds of trees, including spanning trees (ST) [20], [22], [53], breadth-first search (BFS) trees [1], [3], [18], [24], [30], [42], [48], depth-first search (DFS) trees [21], [23], [24], [43], minimum-weight spanning trees (MST) [13], [17], [39], [41], [51], shortest-path spanning trees [38], [44], minimumdiameter spanning trees [12], minimum-degree spanning trees (MDST) [16], etc. Some of these constructions are even silent, with optimal space-complexity.…”

confidence: 99%

“…There is a huge literature on the self-stabilizing construction of various kinds of trees, including spanning trees (ST) [20], [22], [53], breadth-first search (BFS) trees [1], [3], [18], [24], [30], [42], [48], depth-first search (DFS) trees [21], [23], [24], [43], minimum-weight spanning trees (MST) [13], [17], [39], [41], [51], shortest-path spanning trees [38], [44], minimumdiameter spanning trees [12], minimum-degree spanning trees (MDST) [16], etc. Some of these constructions are even silent, with optimal space-complexity.…”

confidence: 99%

“…On the other hand, growing and merging trees is the main technique for designing self-stabilizing leader election algorithms in networks, as the leader is often the root of an inward tree [3,4,2,9]. To the best of our knowledge, all algorithms that do not assume a pre-existing leader [3,4,2,8] for tree-construction use Ωplog nq bits per node. This high space-complexity is due to the implementation of two main techniques, used by all algorithms, and recalled below.…”

confidence: 99%

“…On the other hand, growing and merging trees is the main technique for designing self-stabilizing leader election algorithms in networks, as the leader is often the root of an inward tree [3,4,2]. To the best of our knowledge, all algorithms that do not assume a pre-existing leader [3,4,2,10] for tree-construction use Ωplog nq bits per node. This high space-complexity is due to the implementation of two main techniques, used by all algorithms, and recalled below.…”

confidence: 99%