Fig. 2From: Convergence and covering on graphs for wait-free robotsOptimal graph convergence on a tree. In every round, robots compute a sequence of trees ordered by containmentBack to article page