Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference37 articles.
1. Connected search for a lazy robber;Adler,2019
2. Efficient algorithms for combinatorial problems on graphs with bounded decomposability—A survey;Arnborg;BIT Numer. Math.,1985
3. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Algebr. Discrete Methods,1987
4. Connected graph searching;Barrière;Inform. and Comput.,2012
5. Searching is not jumping;Barrière,2003
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献