Graph Exploration by a Finite Automaton-Reference-Cited by-同舟云学术

Graph Exploration by a Finite Automaton

Published:2004 Issue: Volume: Page:451-462
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Fraigniaud Pierre,Ilcinkas David,Peer Guy,Pelc Andrzej,Peleg David

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-28629-5_34.pdf

Reference35 articles.

1. Albers, S., Henzinger, M.R.: Exploring unknown environments. SIAM J. Computing 29, 1164–1188 (2000)

2. Antelmann, H., Budach, L., Rollik, H.A.: On universal traps. Elektronische Informationsverarbeitung und Kybernetic, EIK 15(3), 123–131 (1979)

3. Asser, G.: Bemerkungen zum Labyrinth-Problem. Elektronische Informationsverarbeitung und Kybernetic, EIK 13(4-5), 203–216 (1977)

4. Awerbuch, B., Betke, M., Rivest, R., Singh, M.: Piecemeal graph learning by a mobile robot. In: 8th Conf. on Comput. Learning Theory, pp. 321–328 (1995)

5. Bar-Eli, E., Berman, P., Fiat, A., Yan, R.: On-line navigation in a room. J. Algorithms 17, 319–341 (1994)

Cited by 13 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Universal Coating by 3D Hybrid Programmable Matter;Lecture Notes in Computer Science;2024

2. Collaboration Without Communication: Evacuating Two Robots from a Disk;Lecture Notes in Computer Science;2017

3. Solving the ANTS Problem with Asynchronous Finite State Machines;Automata, Languages, and Programming;2014

4. Simple agents learn to find their way: An introduction on mapping polygons;Discrete Applied Mathematics;2013-07

5. Cooperating Mobile Agents;Mobile Agents in Networking and Distributed Computing;2012-08-24