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

DOI10.1016/J.TCS.2022.03.035OpenAlexW4221079482MaRDI QIDQ2136288FDOQ2136288

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

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

zbMATH Keywords

treesembeddingsgridstransitive closurenode-failureBoolean network tomography

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Graph theory
• The Complexity of the Partial Order Dimension Problem
• Title not available (Why is that?)
• A Poset Dimension Algorithm
• Title not available (Why is that?)
• The dimension of planar posets
• Network Tomography of Binary Network Performance Characteristics
• Steiner transitive-closure spanners of low-dimensional 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)