L. Barriere, P. Flocchini, P. Fraigniaud, and N. Santoro. Capture of an intruder by mobile agents. In Proceedings of the fourteenth annual ACM symposium on Parallel alg orithms and architectures, pages 200--209. ACM Press, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Price of Connectedness in Expansions - Fomin, Fraigniaud, Thilikos Self-citation (Fraigniaud) (Correct)
No context found.
L. Barriere, P. Flocchini, P. Fraigniaud, and N. Santoro. Capture of an intruder by mobile agents. In 14th ACM Symp. on Parallel Algorithms and Architectures (SPAA), pages 200-209, 2002.
Connected and Internal Graph Searching - Barriere, Fraigniaud, Santoro.. Self-citation (Barriere Fraigniaud Santoro) (Correct)
No context found.
L. Barriere, P. Flocchini, P. Fraigniaud, and N. Santoro. Capture of an intruder by mobile agents. In 14th ACM Symp. on Parallel Algorithms and Architectures (SPAA '02), Winnipeg, August 10-13, 2002.
Contiguous and Internal Graph Searching - Barriere, Fraigniaud, Santoro.. (2002) Self-citation (Barri Fraigniaud Santoro) (Correct)
....practical and theoretical motivations. In particular, graph searching arises in VLSI design, through its equivalence with the gate matrix layout problem (see, e.g. 11, 13, 22] It is also related to network security for its relation with the capture of an intruder by software agents (see, e.g. [1, 17, 35]) and protection from mobile eavesdroppers [16] Moreover, the problem and its variants, i.e. node search, mixed search, inert search, etc. are closely related to standard graph parameters and concepts, including treewidth, cutwidth, pathwidth, and linearwidth [2] For instance, s(G) is equal ....
....a connected set X of edges, remove the searchers and place them in another part of the graph, usually disconnected from X. The problem of determining minimal search strategies under the contiguity constraint is still NP complete in general (it follows from the reduction in [26] as observed in [1]) it has been shown in [1] that minimal contiguous strategies can however be computed in linear time for trees. The next property is perhaps the more practically relevant. A search strategy is internal if, once placed, searchers can only move along the graph edges (i.e. they cannot be removed ....
[Article contains additional citation context not shown here]
L. Barriere, P. Flocchini, P. Fraigniaud, and N. Santoro. Capture of an intruder by mobile agents. To appear in 14th ACM Symp. on Parallel Algorithms and Architectures (SPAA '02), Winnipeg, August 10-13, 2002.
Network Awareness for Mobile Agents on Ad Hoc Networks - Peysakhov, Artz, Sultanik.. (2004) (Correct)
No context found.
L. Barriere, P. Flocchini, P. Fraigniaud, and N. Santoro. Capture of an intruder by mobile agents. In Proceedings of the fourteenth annual ACM symposium on Parallel alg orithms and architectures, pages 200--209. ACM Press, 2002.
Robotic Cops: The Intruder Problem - Vincenzo Gervasi Dipartimento (Correct)
No context found.
L. Barriere, P. Flocchini, P. Fraigniaud, and N. Santoro. Capture of an Intruder by Mobile Agents. In 14 ACM Symposium on Parallel Algorithms and Architectures (SPAA 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC