Skip to main content
SpringerLink
Log in

Bumblebee Visitation Problem

  • Conference paper
  • First Online:
Algorithms and Discrete Applied Mathematics (CALDAM 2019)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11394))

Included in the following conference series:

  • 587 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alspach, B.: Searching and sweeping graphs: a brief survey. Matematiche (Catania) 59, 5–37 (2006)

    MathSciNet  MATH  Google Scholar 

  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. Fomin, F.V., Thilikos, D.M.: An annotated bibliography on guaranteed graph searching. Theor. Comput. Sci. 399(3), 236–245 (2008)

    Article  MathSciNet  Google Scholar 

  4. Hefetz, D., Krivelevich, M., Stojaković, M., Szabó, T.: Positional Games. OWS. Springer, Basel (2014). https://doi.org/10.1007/978-3-0348-0825-5

    Book  MATH  Google Scholar 

  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)

    MATH  Google Scholar 

  6. West, D.B.: Introduction to Graph Theory, 2nd edn. Pearson Education, London (2001)

    Google Scholar 

Download references

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

  1. Indian Statistical Institute, Kolkata, India

    Sandip Das & Harmender Gahlawat

Authors
  1. Sandip Das
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Harmender Gahlawat
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Harmender Gahlawat .

Editor information

Editors and Affiliations

  1. Indian Institute of Technology, Kharagpur, India

    Sudebkumar Prasant Pal

  2. Cochin University of Science and Technology, Cochin, India

    Ambat Vijayakumar

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

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)

Publish with us

Policies and ethics

Search

Navigation