Graph decomposition for improving memoryless periodic exploration

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5734 LNCS, Issue , 2009, Pages 501-512

  Kosowski, Adrian ^a,b   Navarra, Alfredo ^c  

^a UNIVERSITÉ BORDEAUX 1   (France)

^b GDANSK UNIVERSITY OF TECHNOLOGY   (Poland)

^c UNIVERSITY OF PERUGIA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTIVITY PROPERTIES; EXPLORATION STRATEGIES; GRAPH DECOMPOSITIONS; LABELING SCHEME; LABELINGS; LOCAL INFORMATION; TRANSITION FUNCTIONS;

COMPUTER SCIENCE; LABELS;

GRAPH THEORY;

EID: 70349319645     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-03816-7_43     Document Type: Conference Paper

References (12)

1. Czyzowicz, J., Dobrev, S., Gasieniec, L., Ilcinkas, D., Jansson, J., Klasing, R., Lig-nos, Y., Martin, R., Sadakane, K., Sung, W.: More efficient periodic traversal in anonymous undirected graphs. In: Proc. 16th Colloquium on Structural Information and Communication Complexity (SIROCCO). LNCS. Springer, Heidelberg (to appear, 2009)
2. Gasieniec, L., Radzik, T.: Memory efficient anonymous graph exploration. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol.5344, pp. 14-29. Springer, Heidelberg (2008)
3. Dobrev, S., Jansson, J., Sadakane, K., Sung, W.-K.: Finding short right-hand-on-the-wall walks in graphs. In: Pelc, A., Raynal, M. (eds.) SIROCCO 2005. LNCS, vol.3499, pp. 127-139. Springer, Heidelberg (2005)
4. Budach, L.: Automata and labyrinths. Mathematische Nachrichten 86, 195-282 (1978)
5. Rollik, H.: Automaten in planaren graphen. Acta Informatica 13, 287-298 (1980)
6. Cook, S., Rackoff, C.: Space lower bounds for maze threadability on restricted machines. SIAM Journal on Computing 9(3), 636-652 (1980)
7. Fraigniaud, P., Ilcinkas, D., Peer, G., Pelc, A., Peleg, D.: Graph exploration by a finite automaton. Theoretical Computer Science 345(2-3), 331-344 (2005)
8. Reingold, O.: Undirected st-connectivity in log-space. In: Proc. 37th Annual ACM Symposium on Theory of Computing (STOC), pp. 376-385 (2005)
9. Fraigniaud, P., Ilcinkas, D., Pelc, A.: Impact of memory size on graph exploration capability. Discrete Applied Mathematics 156(12), 2310-2319 (2008)
10. Cohen, R., Fraigniaud, P., Ilcinkas, D., Korman, A., Peleg, D.: Label-guided graph exploration by a finite automaton. ACM Transactions on Algorithms 4(4), 1-18 (2008)
11. Ilcinkas, D.: Setting port numbers for fast graph exploration. Theoretical Computer Science 401(1-3), 236-242 (2008)
12. Gasieniec, L., Klasing, R., Martin, R., Navarra, A., Zhang, X.: Fast periodic graph exploration with constant memory. Journal of Computer and System Sciences 74(5), 802-822 (2008)