Skip to main content

Advertisement

Table 1 Summary of results

From: Convergence and covering on graphs for wait-free robots

  Two robots n≥3 robots
Graph convergence G is connected G is a tree
  Theorem 2 Theorem 1
Edge covering G is connected + Unsolvable
  odd-lenght cycle  
  Theorem 3 Lemma 6