INTRUDER CAPTURING IN MESH AND TORUS NETWORKS

DOI10.1142/S0129054108006121zbMATH Open1162.68334OpenAlexW2033012034MaRDI QIDQ3526552FDOQ3526552

N. Imani, Hamid Sarbazi-Azad, Albert Y. Zomaya

Publication date: 25 September 2008

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054108006121

Recommendations

• Distributed chasing of network intruders
• Distributed Chasing of Network Intruders
• scientific article; zbMATH DE number 5244563
• Interception in distance-vector routing networks
• Intruder Capture in Sierpiński Graphs

zbMATH Keywords

interconnection networksgraph searchspherical wave

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Searching and pebbling
• The complexity of searching a graph
• Recontamination does not help to search a graph
• The vertex separation and search number of a graph

Cited In (5)

• Intruder Capture in Sierpiński Graphs
• Distributed Chasing of Network Intruders
• Hamiltonicity of the Torus Network Under the Conditional Fault Model
• Capturing an intruder in product networks
• Capturing an Intruder in the Pyramid

This page was built for publication: INTRUDER CAPTURING IN MESH AND TORUS NETWORKS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3526552)