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

DOI10.1016/j.tcs.2022.03.035OpenAlexW4221079482MaRDI QIDQ2136288

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

gridsembeddingstreestransitive closurenode-failureBoolean network tomography

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Related Items (1)

Vertex-connectivity for node failure identification in Boolean network tomography

Cites Work

• Steiner transitive-closure spanners of low-dimensional posets
• The dimension of planar posets
• Network Tomography of Binary Network Performance Characteristics
• The Complexity of the Partial Order Dimension Problem
• A Poset Dimension Algorithm
• Unnamed Item
• Unnamed Item
• Unnamed Item

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