Fig. 3
From: Convergence and covering on graphs for wait-free robots
Edge covering for two robots. Each robot moves to a central vertex that preserves the odd-path path invariant
Advertisement
Fig. 3 | Journal of the Brazilian Computer Society
