Bumblebee Visitation Problem
Bumblebee visitation problem is defined on connected graphs where a mobile agent, called Bumblebee, moves along the edges under some rules to achieve some optimization function. We prove this problem to be NP-hard for general graphs. We present a linear time algorithm for this problem on trees.
The authors would like to thank the referees for their valuable comments which lead to an improvement of the original manuscript. Authors would also like to thank Uma kant Sahoo for positive discussions.
- 2.Angelopoulos, S., Fraignaud, P., Fomin, F., Nisse, N., Thilikos, D.M.: Report on GRASTA 2017, 6th Workshop on GRAph Searching, Theory and Applications, 10–13 April 2017, Anogia, Crete, Greece (2017)Google Scholar
- 6.West, D.B.: Introduction to Graph Theory, 2nd edn. Pearson Education, London (2001)Google Scholar