INTRUDER CAPTURING IN MESH AND TORUS NETWORKS

DOI10.1142/S0129054108006121zbMath1162.68334OpenAlexW2033012034MaRDI QIDQ3526552

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)

Related Items (1)

Hamiltonicity of the Torus Network Under the Conditional Fault Model

Cites Work

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

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