Author:
Chalopin Jérémie,Das Shantanu,Labourel Arnaud,Markou Euripides
Subject
General Computer Science,Theoretical Computer Science
Reference29 articles.
1. B. Balamohan, P. Flocchini, A. Miri, N. Santoro, Improving the optimal bounds for black hole search in rings, in: Proceedings of 18th Int. Colloquium on Structural Information and Communication Complexity, SIROCCO, 2011, pp. 198–209.
2. Time optimal algorithms for black hole search in rings;Balamohan;Discrete Mathematics, Algorithms and Applications,2011
3. M.A. Bender, D. Slonim, The power of team exploration: two robots can learn unlabeled directed graphs, in: Proceedings of 35th Annual Symposium on Foundations of Computer Science, 1994, pp. 75–85.
4. Tight bounds for scattered black hole search in a ring;Chalopin,2011
5. J. Chalopin, S. Das, N. Santoro, Rendezvous of mobile agents in unknown graphs with faulty links, in: Proceedings of 21st International Conference on Distributed Computing, 2007, pp. 108–122.
Cited by
9 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Asynchronous Gathering in a Dangerous Ring;Algorithms;2023-04-26
2. Black Hole Search in Dynamic Rings;2021 IEEE 41st International Conference on Distributed Computing Systems (ICDCS);2021-07
3. Gathering of robots in a ring with mobile faults;Theoretical Computer Science;2019-04
4. Dangerous Graphs;Distributed Computing by Mobile Entities;2019
5. Moving and Computing Models: Agents;Distributed Computing by Mobile Entities;2019