Afficher la notice abrégée

Label-Guided Graph Exploration by a Finite Automaton

hal.structure.identifierDepartment of Electrical and Computer Engineering [Boston University] [ECE]
dc.contributor.authorCOHEN, Reuven
hal.structure.identifierLaboratoire d'informatique Algorithmique : Fondements et Applications [LIAFA]
dc.contributor.authorFRAIGNIAUD, Pierre
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
hal.structure.identifierAlgorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
dc.contributor.authorILCINKAS, David
hal.structure.identifierLaboratoire d'informatique Algorithmique : Fondements et Applications [LIAFA]
dc.contributor.authorKORMAN, Amos
hal.structure.identifierDepartment of Computer Science and Applied Mathematics [Rehovot]
dc.contributor.authorPELEG, David
dc.date.accessioned2024-04-15T09:53:36Z
dc.date.available2024-04-15T09:53:36Z
dc.date.issued2008-08
dc.identifier.issn1549-6325
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/198617
dc.description.abstractEnA 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.sponsorshipAlgorithm Design and Analysis for Implicitly and Incompletely Defined Interaction Networks - ANR-07-BLAN-0322
dc.language.isoen
dc.publisherAssociation for Computing Machinery
dc.subject.enDistributed algorithms
dc.subject.enGraph exploration
dc.subject.enLabeling schemes
dc.title.enLabel-Guided Graph Exploration by a Finite Automaton
dc.typeArticle de revue
dc.identifier.doi10.1145/1383369.1383373
dc.subject.halInformatique [cs]/Algorithme et structure de données [cs.DS]
dc.subject.halInformatique [cs]/Calcul parallèle, distribué et partagé [cs.DC]
bordeaux.journalACM Transactions on Algorithms
bordeaux.pageArticle 42
bordeaux.volume4
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.issue4
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.peerReviewedoui
hal.identifierhal-00341609
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00341609v1
bordeaux.COinSctx_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


Fichier(s) constituant ce document

FichiersTailleFormatVue

Il n'y a pas de fichiers associés à ce document.

Ce document figure dans la(les) collection(s) suivante(s)

Afficher la notice abrégée