Fig. 7
From: Convergence and covering on graphs for wait-free robots
Topological perspective of edge-covering. G and colored graph \(\tilde {G}\), with input \(\tilde {I}\) and views after one round \(X(\tilde {I})\), for robots A,B
Advertisement
Fig. 7 | Journal of the Brazilian Computer Society
