Brief announcement: On the power of one bit in graph exploration without backtracking

Abstract : We consider a model of a deterministic (Ma,Mw)-agent with Ma bits of internal memory and Mw bits at each node of some graph G that is able to visit vertices and traverse edges of G. The memory at each node is accesible only upon visiting to that node. The goal of the agent is to explore an anonymous and initially unknown G, i.e. visit all its n nodes.
Document type :
Conference papers
Yoram Moses; Matthieu Roy. DISC 2015, Oct 2015, Tokyo, Japan. Springer-Verlag Berlin Heidelberg, LNCS 9363, 29th International Symposium on Distributed Computing
Liste complète des métadonnées

Cited literature [3 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01207849
Contributor : Matthieu Roy <>
Submitted on : Thursday, October 1, 2015 - 2:25:19 PM
Last modification on : Friday, November 17, 2017 - 3:28:02 PM
Document(s) archivé(s) le : Saturday, January 2, 2016 - 11:02:57 AM

File

15-BA.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-01207849, version 1

Collections

Citation

Artur Menc, Dominik Pajak, Przemysaaw Uznaski. Brief announcement: On the power of one bit in graph exploration without backtracking. Yoram Moses; Matthieu Roy. DISC 2015, Oct 2015, Tokyo, Japan. Springer-Verlag Berlin Heidelberg, LNCS 9363, 29th International Symposium on Distributed Computing. 〈hal-01207849〉

Share

Metrics

Record views

48

Files downloads

55