Please use this identifier to cite or link to this item: https://doi.org/10.1007/978-3-642-11476-2_14
Title: More efficient periodic traversal in anonymous undirected graphs
Authors: Czyzowicz, J.
Dobrev, S.
Ga̧sieniec, L.
Ilcinkas, D.
Jansson, J.
Klasing, R.
Lignos, I.
Martin, R.
Sadakane, K.
Sung, W.-K. 
Issue Date: 2010
Source: Czyzowicz, J., Dobrev, S., Ga̧sieniec, L., Ilcinkas, D., Jansson, J., Klasing, R., Lignos, I., Martin, R., Sadakane, K., Sung, W.-K. (2010). More efficient periodic traversal in anonymous undirected graphs. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 5869 LNCS : 167-181. ScholarBank@NUS Repository. https://doi.org/10.1007/978-3-642-11476-2_14
Abstract: We 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 [1]. However, surprisingly small periods can be achieved when assigning carefully the local port numbers. Dobrev et al. [2] 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 [3] 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/3n 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. © 2010 Springer.
Source Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
URI: http://scholarbank.nus.edu.sg/handle/10635/41173
ISBN: 364211475X
ISSN: 03029743
DOI: 10.1007/978-3-642-11476-2_14
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

5
checked on Dec 14, 2017

WEB OF SCIENCETM
Citations

1
checked on Nov 20, 2017

Page view(s)

53
checked on Dec 17, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.