On the strongest message adversary for consensus in directed dynamic networks

DOI10.1007/978-3-030-01325-7_13OpenAlexW2898757822MaRDI QIDQ1713900

Manfred Schwarz, Kyrill Winkler, Ulrich Schmid

Publication date: 30 January 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-01325-7_13

zbMATH Keywords

consensusdynamic networksfailure detectorsstrongest message adversary

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer system organization (68Mxx)

This page was built for publication: On the strongest message adversary for consensus in directed dynamic networks