Tight bounds to localize failure nodes on trees, grids and through embeddings under boolean network tomography

• Published in: Theoretical computer science Vol. 919; pp. 103 - 117
• Main Authors: Galesi, Nicola, Ranjbar, Fariba
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 05.06.2022
• Subjects: Boolean network tomography; Embeddings; Grids; Node-failure; Transitive closure; Trees; Trees; Grids; Boolean network tomography; Transitive closure; Embeddings; Node-failure

Maximal identifiability was recently introduced in boolean network tomography to measure the maximal number of corrupted nodes which can be uniquely localized in sets of end-to-end measurement paths on networks ([1,2]). We contribute to the study of maximal identifiability proving upper and lower bo...