Author:
Dhar Amit Kumar,Gorain Barun,Mondal Kaushik,Patra Shaswati,Singh Rishi Ranjan
Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software
Reference30 articles.
1. Awerbuch B, Betke M, Ronald L, Rivest M. Singh (1999) Piecemeal graph exploration by a mobile robot. Inf Comput 152:155–172
2. Bender MA, Fernández A, Ron D, Sahai A, Vadhan SP (2002) The power of a pebble: exploring and mapping directed graphs. Inf Comput 176:1–21
3. Bender MA, Slonim D (1994) The power of team exploration: two robots can learn unlabeled directed graphs. In: Proceedings of the 35th annual symposium on foundations of computer science (FOCS 1994), pp 75–85
4. Borodin A, Ruzzo W, Tompa M (1992) Lower bounds on the length of universal traversal sequences. J Comput Syst Sci 45:180–203
5. Boyar J, Favrholdt LM, Kudahl C, Larsen KS, Mikkelsen JW (2017) Online algorithms with advice: a survey. ACM Comput Surv 50(2):19:1-19:34
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Graph Covering Using Bounded Size Subgraphs;Algorithms and Discrete Applied Mathematics;2023