Vertex-connectivity for node failure identification in Boolean network tomography

DOI10.1016/J.IPL.2023.106450MaRDI QIDQ6121431zbMATH OpenOpenAlexFDO

Authors Nicola Galesi, Fariba Ranjbar, Michele Zito

Publication date 26 March 2024

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ipl.2023.106450

zbMATH Keywords

augmented gridsBoolean network tomographycombinatorial problemsfailure identificationvertex connectivity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Recommendations

• Vertex-connectivity for node failure identification in Boolean network tomography
• Tight bounds to localize failure nodes on trees, grids and through embeddings under Boolean network tomography
• Network Failure Detection and Graph Connectivity
• Network failure detection and graph connectivity
• Detecting a Network Failure

Cites work

• Graph-Constrained Group Testing
• scientific article; zbMATH DE number 3573910 (Why is no real title available?)
• scientific article; zbMATH DE number 1508646 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data
• Network tomography: recent developments
• Tight bounds to localize failure nodes on trees, grids and through embeddings under Boolean network tomography

Cited in

(3)

• Tight bounds to localize failure nodes on trees, grids and through embeddings under Boolean network tomography
• Vertex-connectivity for node failure identification in Boolean network tomography
• The complexity of Boolean failure identification

This page was built for publication: Vertex-connectivity for node failure identification in Boolean network tomography

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