Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Alspach, B.: Searching and sweeping graphs: a brief survey. Matematiche (Catania) 59, 5–37 (2006)
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)
Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. 399(3), 236–245 (2008)
Hefetz, D., Krivelevich, M., Stojaković, M., Szabó, T.: Positional Games. OWS. Springer, Basel (2014). https://doi.org/10.1007/978-3-0348-0825-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)
West, D.B.: Introduction to Graph Theory, 2nd edn. Pearson Education, London (2001)
Acknowledgements
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.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Das, S., Gahlawat, H. (2019). Bumblebee Visitation Problem. In: Pal, S., Vijayakumar, A. (eds) Algorithms and Discrete Applied Mathematics. CALDAM 2019. Lecture Notes in Computer Science(), vol 11394. Springer, Cham. https://doi.org/10.1007/978-3-030-11509-8_21
Download citation
DOI: https://doi.org/10.1007/978-3-030-11509-8_21
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-11508-1
Online ISBN: 978-3-030-11509-8
eBook Packages: Computer ScienceComputer Science (R0)