Abstract
An n-node tree has to be explored by k mobile agents (robots), starting at its root. Every edge of the tree must be traversed by at least one robot, and exploration must be completed as fast as pos...
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have