Search results for: GRAFY ANONIMOWE

• Graph Decomposition for Memoryless Periodic Exploration

  Publication

  • A. Kosowski
  • A. Navarra

  - ALGORITHMICA - Year 2012

  We consider a general framework in which a memoryless robot periodically explores all the nodes of a connected anonymous graph by following local information available at each vertex. For each vertex v, the endpoints of all edges adjacent to v are assigned unique labels within the range 1 to deg (v) (the degree of v). The generic exploration strategy is implemented using a right-hand-rule transition function: after entering vertex...

  Full text to download in external service