Subject
General Computer Science,Theoretical Computer Science
Reference23 articles.
1. Asynchronous exploration of an unknown anonymous dangerous graph with O(1) pebbles;Balamohan,2012
2. Time optimal algorithms for black hole search in rings;Balamohan;Discrete Math. Algorithms Appl.,2011
3. Rendezvous of mobile agents in unknown graphs with faulty links;Chalopin,2007
4. More efficient periodic traversal in anonymous undirected graphs;Czyzowicz;Theoret. Comput. Sci.,2012
5. Black hole search in common interconnection networks;Dobrev;Networks,2006
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Gathering of Robots in a Grid with Mobile Faults;SOFSEM 2019: Theory and Practice of Computer Science;2019
2. Dangerous Graphs;Distributed Computing by Mobile Entities;2019
3. Moving and Computing Models: Agents;Distributed Computing by Mobile Entities;2019