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

cactus representationconnectivitydetection setsminimal cutsnetwork failuresVC-dimension

Mathematics Subject Classification ID

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

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

(10)

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

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)