Vertex-connectivity for node failure identification in Boolean network tomography

DOI10.1016/j.ipl.2023.106450OpenAlexW4387514368MaRDI QIDQ6121431

Nicola Galesi, Michele Zito, Fariba Ranjbar

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

combinatorial problemsvertex connectivityaugmented gridsBoolean network tomographyfailure identification

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Tight bounds to localize failure nodes on trees, grids and through embeddings under Boolean network tomography
• Network tomography: recent developments
• Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data
• Graph-Constrained Group Testing

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