Label-Guided Graph Exploration by a Finite Automaton
hal.structure.identifier | Department of Electrical and Computer Engineering [Boston University] [ECE] | |
dc.contributor.author | COHEN, Reuven | |
hal.structure.identifier | Laboratoire d'informatique Algorithmique : Fondements et Applications [LIAFA] | |
dc.contributor.author | FRAIGNIAUD, Pierre | |
hal.structure.identifier | Laboratoire Bordelais de Recherche en Informatique [LaBRI] | |
hal.structure.identifier | Algorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE] | |
dc.contributor.author | ILCINKAS, David | |
hal.structure.identifier | Laboratoire d'informatique Algorithmique : Fondements et Applications [LIAFA] | |
dc.contributor.author | KORMAN, Amos | |
hal.structure.identifier | Department of Computer Science and Applied Mathematics [Rehovot] | |
dc.contributor.author | PELEG, David | |
dc.date.accessioned | 2024-04-15T09:53:36Z | |
dc.date.available | 2024-04-15T09:53:36Z | |
dc.date.issued | 2008-08 | |
dc.identifier.issn | 1549-6325 | |
dc.identifier.uri | https://oskar-bordeaux.fr/handle/20.500.12278/198617 | |
dc.description.abstractEn | A finite automaton, simply referred to as a {\em robot}, has to explore a graph, i.e., visit all the nodes of the graph. The robot has no a priori knowledge of the topology of the graph or of its size. It is known that, for any $k$-state robot, there exists a graph of maximum degree~3 that the robot cannot explore. This paper considers the effects of allowing the system designer to add short labels to the graph nodes in a preprocessing stage, and using these labels to guide the exploration by the robot. We describe an exploration algorithm that given appropriate 2-bit labels (in fact, only 3-valued labels) allows a robot to explore all graphs. Furthermore, we describe a suitable labeling algorithm for generating the required labels, in linear time. We also show how to modify our labeling scheme so that a robot can explore all graphs of bounded degree, given appropriate 1-bit labels. In other words, although there is no robot able to explore all graphs of maximum degree~3, there is a robot $\cR$, and a way to color in black or white the nodes of any bounded-degree graph $G$, so that $\cR$ can explore the colored graph $G$. Finally, we give impossibility results regarding graph exploration by a robot with no internal memory (i.e., a single state automaton). | |
dc.description.sponsorship | Algorithm Design and Analysis for Implicitly and Incompletely Defined Interaction Networks - ANR-07-BLAN-0322 | |
dc.language.iso | en | |
dc.publisher | Association for Computing Machinery | |
dc.subject.en | Distributed algorithms | |
dc.subject.en | Graph exploration | |
dc.subject.en | Labeling schemes | |
dc.title.en | Label-Guided Graph Exploration by a Finite Automaton | |
dc.type | Article de revue | |
dc.identifier.doi | 10.1145/1383369.1383373 | |
dc.subject.hal | Informatique [cs]/Algorithme et structure de données [cs.DS] | |
dc.subject.hal | Informatique [cs]/Calcul parallèle, distribué et partagé [cs.DC] | |
bordeaux.journal | ACM Transactions on Algorithms | |
bordeaux.page | Article 42 | |
bordeaux.volume | 4 | |
bordeaux.hal.laboratories | Laboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800 | * |
bordeaux.issue | 4 | |
bordeaux.institution | Université de Bordeaux | |
bordeaux.institution | Bordeaux INP | |
bordeaux.institution | CNRS | |
bordeaux.peerReviewed | oui | |
hal.identifier | hal-00341609 | |
hal.version | 1 | |
hal.popular | non | |
hal.audience | Internationale | |
hal.origin.link | https://hal.archives-ouvertes.fr//hal-00341609v1 | |
bordeaux.COinS | ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=ACM%20Transactions%20on%20Algorithms&rft.date=2008-08&rft.volume=4&rft.issue=4&rft.spage=Article%2042&rft.epage=Article%2042&rft.eissn=1549-6325&rft.issn=1549-6325&rft.au=COHEN,%20Reuven&FRAIGNIAUD,%20Pierre&ILCINKAS,%20David&KORMAN,%20Amos&PELEG,%20David&rft.genre=article |
Files in this item
Files | Size | Format | View |
---|---|---|---|
There are no files associated with this item. |