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

DOI10.1016/J.TCS.2022.03.035MaRDI QIDQ2136288zbMATH OpenOpenAlexFDO

Authors Nicola Galesi, Fariba Ranjbar

Publication date 10 May 2022

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2022.03.035

zbMATH Keywords

treesembeddingsgridstransitive closurenode-failureBoolean network tomography

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Vertex-connectivity for node failure identification in Boolean network tomography
• Vertex-connectivity for node failure identification in Boolean network tomography
• Detecting a Network Failure
• On Minimal Test Sets for Locating Single Link Failures in Networks
• On fault identification in interconnection networks under the comparison model

Cites work

• scientific article; zbMATH DE number 432759 (Why is no real title available?)
• scientific article; zbMATH DE number 53952 (Why is no real title available?)
• A Poset Dimension Algorithm
• Graph theory
• Network Tomography of Binary Network Performance Characteristics
• Steiner transitive-closure spanners of low-dimensional posets
• The Complexity of the Partial Order Dimension Problem
• The dimension of planar posets

Cited in

(2)

• Vertex-connectivity for node failure identification in Boolean network tomography
• Vertex-connectivity for node failure identification in Boolean network tomography

This page was built for publication: Tight bounds to localize failure nodes on trees, grids and through embeddings under Boolean network tomography

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