How to meet when you forget: log-space rendezvous in arbitrary graphs

@article{Czyzowicz2010HowTM,
  title={How to meet when you forget: log-space rendezvous in arbitrary graphs},
  author={Jurek Czyzowicz and Adrian Kosowski and Andrzej Pelc},
  journal={Distributed Computing},
  year={2010},
  volume={25},
  pages={165-178}
}
Two identical (anonymous) mobile agents start from arbitrary nodes in an a priori unknown graph and move synchronously from node to node with the goal of meeting. This rendezvous problem has been thoroughly studied, both for anonymous and for labeled agents, along with another basic task, that of exploring graphs by mobile agents. Intuitively, the rendezvous problem is more difficult than exploration, as it reduces to the latter, if one of the agents is inert. A well-known recent result on… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

References

Publications referenced by this paper.
Showing 1-2 of 2 references

Similar Papers

Loading similar papers…