Fig. 2
From: Convergence and covering on graphs for wait-free robots
Optimal graph convergence on a tree. In every round, robots compute a sequence of trees ordered by containment
Advertisement
Fig. 2 | Journal of the Brazilian Computer Society
