31 search results - page 7 / 7 » Local algorithms in (weakly) coloured graphs |
TALG
2011
13 years 17 days ago
2011
We consider the task of network exploration by a mobile agent (robot) with small memory. The agent has to traverse all nodes and edges of a network (represented as an undirected c...