Coloring graph products—a survey
Discrete Mathematics - Special issue on combinatorics
Efficient VLSI Layouts for Homogeneous Product Networks
IEEE Transactions on Computers
A Theory for Total Exchange in Multidimensional Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Minimal Fault Diameter for Highly Resilient Product Networks
IEEE Transactions on Parallel and Distributed Systems
Capture of an intruder by mobile agents
Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
On the fractional chromatic number, the chromatic number, and graph products
Discrete Mathematics
Generalized Algorithm for Parallel Sorting on Product Networks
IEEE Transactions on Parallel and Distributed Systems
Constructing Edge-Disjoint Spanning Trees in Product Networks
IEEE Transactions on Parallel and Distributed Systems
Contiguous Search in the Hypercube for Capturing an Intruder
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Fault diameter of Cartesian product graphs
Information Processing Letters
A pursuer-evader game for sensor networks
SSS'03 Proceedings of the 6th international conference on Self-stabilizing systems
| Hi-index | 0.00 |
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.