Exact(9)
Then, A solves graph convergence (edge covering) on G for n−1 robots.
As observed by Remark 2 in the proof of Lemma 4, A solves edge covering on G for two robots.
Since A solves graph convergence, it outputs vertices that span a vertex or an edge of G.
Therefore, this last remark implies that we can assume A solves graph convergence on G for three robots.
The properties of A make easy to achieve agreement: at most to distinct indexes are decided since A solves graph convergence.
Since A solves graph convergence on G, the values it returns y1,y2 and y3 to p1,p2, and p3, respectively, cover a vertex or an edge of G, hence at most two distinct indexes are decided.
Similar(51)
It's a solved problem.
"I really consider autonomous driving a solved problem," he said.
We feel this is a solved problem.
It is kind of a solved problem.
Getting genotypes is in a way a solved problem.
Write better and faster with AI suggestions while staying true to your unique style.
Since I tried Ludwig back in 2017, I have been constantly using it in both editing and translation. Ever since, I suggest it to my translators at ProSciEditing.

Justyna Jupowicz-Kozak
CEO of Professional Science Editing for Scientists @ prosciediting.com