Afficher la notice abrégée

More Efficient Periodic Traversal in Anonymous Undirected Graphs

hal.structure.identifierDépartement d'Informatique et d'Ingénierie [DII]
dc.contributor.authorCZYZOWICZ, Jurek
hal.structure.identifierInstitute of Mathematics
dc.contributor.authorDOBREV, Stefan
hal.structure.identifierDepartment of Computer Science [Liverpool]
dc.contributor.authorGASIENIEC, Leszek
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.identifierOchanomizu University
dc.contributor.authorJANSSON, Jesper
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
hal.structure.identifierAlgorithmics for computationally intensive applications over wide scale distributed platforms [CEPAGE]
dc.contributor.authorKLASING, Ralf
hal.structure.identifierDepartment of Computer Science
dc.contributor.authorLIGNOS, Ioannis
hal.structure.identifierDepartment of Computer Science [Liverpool]
dc.contributor.authorMARTIN, Russell
hal.structure.identifierPrinciples of Informatics Research Division
dc.contributor.authorSADAKANE, Kunihiko
hal.structure.identifierDepartment of Computer Science
dc.contributor.authorSUNG, Wing-Kin
dc.date.accessioned2024-04-15T09:51:49Z
dc.date.available2024-04-15T09:51:49Z
dc.date.issued2009-05
dc.date.conference2009-05
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/198463
dc.description.abstractEnWe consider the problem of periodic graph exploration in which a mobile entity with (at most) constant memory, an agent, has to visit all $n$ nodes of an arbitrary undirected graph G in a periodic manner. Graphs are supposed to be anonymous, that is, nodes are unlabeled. However, while visiting a node, the robot has to distinguish between edges incident to it. For each node v the endpoints of the edges incident to v are uniquely identified by different integer labels called port numbers. We are interested in the minimisation of the length of the exploration period. This problem is unsolvable if the local port numbers are set arbitrarily, see [Budach78]. However, surprisingly small periods can be achieved when assigning carefully the local port numbers. Dobrev et al. [DJSS05] described an algorithm for assigning port numbers, and an oblivious agent (i.e., an agent with no persistent memory) using it, such that the agent explores all graphs of size n within period 10n. Providing the agent with a constant number of memory bits, the optimal length of the period was proved in [GKMNZ08] to be no more than 3.75n (using a different assignment of the port numbers). In this paper, we improve both these bounds. More precisely, we show a period of length at most (4+1/3)n for oblivious agents, and a period of length at most 3.5n for agents with constant memory. Finally, we give the first non-trivial lower bound, 2.8n, on the period length for the oblivious case.
dc.description.sponsorshipALgorithmique des Plates-formes A Grande Echelle - ANR-05-MMSA-0006
dc.language.isoen
dc.publisherSpringer Berlin / Heidelberg
dc.source.titleProceedings of the 16th Colloquium on Structural Information and Communication Complexity
dc.subjectgraph exploration
dc.title.enMore Efficient Periodic Traversal in Anonymous Undirected Graphs
dc.typeCommunication dans un congrès
dc.identifier.doi10.1007/978-3-642-11476-2_14
dc.subject.halInformatique [cs]/Calcul parallèle, distribué et partagé [cs.DC]
dc.subject.halInformatique [cs]/Mathématique discrète [cs.DM]
bordeaux.page174--188
bordeaux.volume5869
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.conference.titleSIROCCO 2009
bordeaux.countrySI
bordeaux.title.proceedingProceedings of the 16th Colloquium on Structural Information and Communication Complexity
bordeaux.peerReviewedoui
hal.identifierhal-00371489
hal.version1
hal.invitednon
hal.proceedingsoui
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//hal-00371489v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.btitle=Proceedings%20of%20the%2016th%20Colloquium%20on%20Structural%20Information%20and%20Communication%20Complexity&rft.date=2009-05&rft.volume=5869&rft.spage=174--188&rft.epage=174--188&rft.au=CZYZOWICZ,%20Jurek&DOBREV,%20Stefan&GASIENIEC,%20Leszek&ILCINKAS,%20David&JANSSON,%20Jesper&rft.genre=unknown


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