Distributed chasing of network intruders-Reference-Cited by-同舟云学术

Distributed chasing of network intruders

Published:2008-06 Issue:1-2 Volume:399 Page:12-37
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Blin Lélia,Fraigniaud Pierre,Nisse Nicolas,Vial Sandrine

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference31 articles.

1. Complexity of finding embeddings in a k-tree;Arnborg;SIAM J. Alg. Disc. Meth.,1987

2. L. Barrière, P. Flocchini, P. Fraigniaud, N. Santoro, Capture of an intruder by mobile agents, in: 14th ACM Symp. on Parallel Algorithms and Architectures, SPAA, 2002, pp. 200–209

3. 29th Workshop on Graph Theoretic Concepts in Computer Science (WG);Barrière,2003

4. M. Bender, A. Fernandez, D. Ron, A. Sahai, S. Vadhan, The power of a pebble: Exploring and mapping directed graphs, in: 30th Ann. Symp. on Theory of Computing, STOC, 1998 pp. 269–278

5. M. Bender, D. Slonim, The power of team exploration: Two robots can learn unlabeled directed graphs, in: 35th Ann. Symp. on Foundations of Computer Science, FOCS, 1994, pp. 75–85

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Cops and robber on grids and tori: basic algorithms and their extension to a large number of cops;The Journal of Supercomputing;2021-02-16

2. Black Virus Decontamination of Synchronous Ring Networks by Initially Scattered Mobile Agents;Structural Information and Communication Complexity;2020

3. Cops and Robbers on Dynamic Graphs: Offline and Online Case;Structural Information and Communication Complexity;2020

4. Finding small-width connected path decompositions in polynomial time;Theoretical Computer Science;2019-11

5. On-line Search in Two-Dimensional Environment;Theory of Computing Systems;2019-09-11