Wyniki wyszukiwania dla: PAMIĘĆ LOGARYTMICZNA

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

  Publikacja

  • J. Czyzowicz
  • A. Kosowski
  • A. Pelc

  - DISTRIBUTED COMPUTING - Rok 2011

  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. The rendezvous problem is known to be not easier than graph exploration. A well-known recent result...

  Pełny tekst do pobrania w serwisie zewnętrznym