Network Failure Detection and Graph Connectivity

DOI10.1137/070697793zbMath1178.68288OpenAlexW2107280545MaRDI QIDQ3395033

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

minimal cutsVC-dimensionconnectivitycactus 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)

Related Items (2)

Minimum failure explanations for path vector routing changes ⋮ Digraphs with Distinguishable Dynamics Under the Multi‐Agent Agreement Protocol

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