Network Failure Detection and Graph Connectivity

DOI10.1137/070697793MaRDI QIDQ3395033zbMATH OpenOpenAlexFDO

Authors Mark Sandler, Aleksandrs Slivkins, Jon M. Kleinberg

Publication date 20 August 2009

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/070697793

zbMATH Keywords

connectivityVC-dimensionminimal cutscactus representationdetection setsnetwork failures

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Connectivity (05C40)

Recommendations

• Network failure detection and graph connectivity
• Detecting a Network Failure
• Connectivity oracles for graphs subject to vertex failures
• Connectivity oracles for failure prone graphs
• Connectivity oracles for graphs subject to vertex failures

Cited in

(9)

• A graph-based framework for complex system simulating and diagnosis with automatic reconfiguration
• Minimum failure explanations for path vector routing changes
• Network failure detection and graph connectivity
• Digraphs with distinguishable dynamics under the multi-agent agreement protocol
• scientific article; zbMATH DE number 3990887 (Why is no real title available?)
• Fault-detection in networks
• Vertex-connectivity for node failure identification in Boolean network tomography
• Detecting a Network Failure
• Vertex-connectivity for node failure identification in Boolean network tomography

This page was built for publication: Network Failure Detection and Graph Connectivity

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