Skip to main content
SpringerLink
Log in

Deterministic Rendezvous in Graphs

  • Conference paper
Algorithms - ESA 2003 (ESA 2003)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2832))

Included in the following conference series:

Abstract

Two mobile agents having distinct identifiers and located in nodes of an unknown anonymous connected graph, have to meet at some node of the graph. We present fast deterministic algorithms for this rendezvous problem.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alpern, S.: The rendezvous search problem. SIAM J. on Control and Optimization 33(3), 673–683 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  2. Alpern, S.: Rendezvous search on labelled networks. Naval Reaserch Logistics 49, 256–274 (2002)

    Article  MathSciNet  MATH  Google Scholar 

  3. Alpern, S., Gal, S.: The theory of search games and rendezvous. Int. Series in Operations research and Management Science, vol. 55. Kluwer Academic Publishers, Dordrecht (2002)

    Google Scholar 

  4. Alpern, J., Baston, V., Essegaier, S.: Rendezvous search on a graph. Journal of Applied Probability 36(1), 223–231 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  5. Alpern, S., Gal, S.: Rendezvous search on the line with distinguishable players. SIAM J. on Control and Optimization 33, 1270–1276 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  6. Anderson, E., Weber, R.: The rendezvous problem on discrete locations. Journal of Applied Probability 28, 839–851 (1990)

    Article  MathSciNet  Google Scholar 

  7. Anderson, E., Essegaier, S.: Rendezvous search on the line with indistinguishable players. SIAM J. on Control and Optimization 33, 1637–1642 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  8. Anderson, E., Fekete, S.: Asymmetric rendezvous on the plane. In: Proc. 14th Annual ACM Symp. on Computational Geometry (1998)

    Google Scholar 

  9. Anderson, E., Fekete, S.: Two-dimensional rendezvous search. Operations Research 49, 107–118 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  10. Baston, V., Gal, S.: Rendezvous on the line when the players’ initial distance is given by an unknown probability distribution. SIAM J. on Control and Optimization 36, 1880–1889 (1998)

    Article  MathSciNet  MATH  Google Scholar 

  11. Baston, V., Gal, S.: Rendezvous search when marks are left at the starting points. Naval Res. Log. 48, 722–731 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  12. Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Gathering of asynchronous oblivious robots with limited visibility. In: Ferreira, A., Reichel, H. (eds.) STACS 2001. LNCS, vol. 2010, pp. 247–258. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  13. Gal, S.: Rendezvous search on the line. Operations Research 47, 974–976 (1999)

    Article  MATH  Google Scholar 

  14. Howard, J.: Rendezvous search on the interval and circle. Operation research 47(4), 550–558 (1999)

    Article  MATH  Google Scholar 

  15. Lim, W., Alpern, S.: Minimax rendezvous on the line. SIAM J. on Control and Optimization 34(5), 1650–1665 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  16. Schelling, T.: The strategy of conflict. Oxford University Press, Oxford (1960)

    Google Scholar 

  17. Thomas, L.: Finding your kids when they are lost. Journal on Operational Res. Soc. 43, 637–639 (1992)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Lund Univ., Box 118, S-22100, Lund, Sweden

    Anders Dessmark

  2. CNRS, LRI, Univ. Paris Sud, 91405, Orsay, France

    Pierre Fraigniaud

  3. Dép. d’Informatique, Univ. du Québec en Outaouais, Hull, Québec, J8X 3X7, Canada

    Andrzej Pelc

Authors
  1. Anders Dessmark
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Pierre Fraigniaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Andrzej Pelc
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica e Automazione, Università degli Studi “Roma Tre”, via della Vasca Navale 79, 00146, Rome, Italy

    Giuseppe Di Battista

  2. School of Computer Science, Tel Aviv University, 69978, Tel Aviv, Israel

    Uri Zwick

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Dessmark, A., Fraigniaud, P., Pelc, A. (2003). Deterministic Rendezvous in Graphs. In: Di Battista, G., Zwick, U. (eds) Algorithms - ESA 2003. ESA 2003. Lecture Notes in Computer Science, vol 2832. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39658-1_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-39658-1_19

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-20064-2

  • Online ISBN: 978-3-540-39658-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation