Vertex-connectivity for node failure identification in Boolean network tomography

DOI10.1007/978-3-030-34405-4_5zbMATH Open1540.68176MaRDI QIDQ6536156

Fariba Ranjbar, Michele Zito, Nicola Galesi

Publication date: 5 April 2024

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An algorithm for finding Hamilton paths and cycles in random graphs
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Network tomography: recent developments
• Finding Large Independent Sets in Line of Sight Networks
• Network Tomography: Estimating Source-Destination Traffic Intensities from Link Data
• Communication Problems in Random Line-of-Sight Ad-Hoc Radio Networks
• Independent Sets in Restricted Line of Sight Networks
• Graph-Constrained Group Testing

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