Small cuts and connectivity certificates: a fault tolerant approach
From MaRDI portal
Publication:6487547
DOI10.4230/LIPICS.DISC.2019.30zbMath1515.6808MaRDI QIDQ6487547
Publication date: 3 February 2023
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40) Distributed algorithms (68W15)
Related Items (4)
Invited talk: Resilient distributed algorithms ⋮ Distributed CONGEST Algorithms against Mobile Adversaries ⋮ Fast distributed approximation for TAP and 2-edge-connectivity ⋮ Finding a small vertex cut on distributed networks
This page was built for publication: Small cuts and connectivity certificates: a fault tolerant approach
