Search citation statements

Paper Sections

Select...

3

1

1

Citation Types

0

19

0

Year Published

2018

2018

Publication Types

Select...

2

Relationship

2

0

Authors

Journals

(19 citation statements)

(47 reference statements)

0

19

0

“…In summary, previous work on exploration of dynamic graphs restricts strongly the dynamic of the considered graph. The notable exception is a recent work on perpetual exploration of highly dynamic rings [5]. This paper shows that, three (resp.…”

confidence: 72%

“…In summary, previous work on exploration of dynamic graphs restricts strongly the dynamic of the considered graph. The notable exception is a recent work on perpetual exploration of highly dynamic rings [5]. This paper shows that, three (resp.…”

confidence: 72%

“…We give a first answer to this question by exhibiting the necessary and sufficient numbers of such robots to perpetually explore any connected-over-time ring, i.e., any dynamic ring with very weak assumption on connectivity: every node is infinitely often reachable from any another one without any recurrence, periodicity, nor stability assumption. More precisely, we showed that necessary and sufficient numbers of robots proved in [5] in a fault-free setting (2 robots for rings of size 3 and 3 robots for rings of size greater than 4) still hold in the self-stabilizing setting at the price of the loss of anonymity of robots. In addition to the above contributions, our results overcome the robot networks state-of-the-art in a couple of ways.…”

confidence: 96%

“…On the other hand, few algorithms have been designed for robots evolving in dynamic graphs. The majority of them deals with the problem of exploration [3,4,11,13,18] (robots must visit each node of the graph at least once or infinitely often depending on the variant of the problem). In the most related work to ours [19], Di Luna et al study the gathering problem in dynamic rings.…”

confidence: 99%