INTRUDER CAPTURING IN MESH AND TORUS NETWORKS

DOI10.1142/S0129054108006121MaRDI QIDQ3526552zbMATH OpenOpenAlexFDO

Authors 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

zbMATH Keywords

interconnection networksgraph searchspherical wave

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

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

Cites work

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

Cited in

(5)

• Hamiltonicity of the torus network under the conditional fault model
• Intruder Capture in Sierpiński Graphs
• Distributed Chasing of Network Intruders
• Capturing an Intruder in the Pyramid
• Capturing an intruder in product networks

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)