Subject
General Computer Science,Theoretical Computer Science
Reference39 articles.
1. Fault-tolerant gathering algorithms for autonomous mobile robots;Agmon;SIAM J. Comput.,2006
2. The Theory of Search Games and Rendezvous;Alpern,2003
3. Connected graph searching;Barriere;Inform. and Comput.,2012
4. Gathering of mobile robots tolerating multiple crash faults;Bouzid,2013
5. Tight bounds for black hole search with scattered agents in synchronous rings;Chalopin;Theoret. Comput. Sci.,2013
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献