In this paper, we envision a solution to the problem of capturing an intruder in a product network. This solution is derived based on the assumed existing algorithms for basic member graphs of a graph product. In this problem, a team of cleaner agents are responsible for capturing a hostile intruder in the network. While the agents can move in the network one hop at a time, the intruder is assumed to be arbitrarily fast in a way that it can traverse any number of nodes contiguously as far as no agents reside in those nodes. Here, we consider a version of the problem where each agent can replicate new agents. Hence, the algorithm start with a single agent and new agents are created on demand. © 2006 Springer-Verlag.
CITATION STYLE
Imani, N., Sarbazi-Azad, H., & Zomaya, A. (2006). Capturing an intruder in product networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4297 LNCS, pp. 193–204). https://doi.org/10.1007/11945918_23
Mendeley helps you to discover research relevant for your work.