Bumblebee Visitation Problem

  • Sandip Das
  • Harmender GahlawatEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 11394)


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.


  1. 1.
    Alspach, B.: Searching and sweeping graphs: a brief survey. Matematiche (Catania) 59, 5–37 (2006)MathSciNetzbMATHGoogle Scholar
  2. 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
  3. 3.
    Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. 399(3), 236–245 (2008)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Hefetz, D., Krivelevich, M., Stojaković, M., Szabó, T.: Positional Games. OWS. Springer, Basel (2014). Scholar
  5. 5.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York (1979)zbMATHGoogle Scholar
  6. 6.
    West, D.B.: Introduction to Graph Theory, 2nd edn. Pearson Education, London (2001)Google Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  1. 1.Indian Statistical InstituteKolkataIndia

Personalised recommendations