Skip to main content
Advertisement
Search
Get published
Explore Journals
Books
About
My account
Search all SpringerOpen articles
Search
Journal of the Brazilian Computer Society
About
Articles
Submission Guidelines
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
Back to article page