Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs
classification
💻 cs.DC
keywords
byzantineconsensusgraphsiterativealgorithmsapproximatearbitrarycondition
read the original abstract
In this paper, we explore the problem of iterative approximate Byzantine consensus in arbitrary directed graphs. In particular, we prove a necessary and sufficient condition for the existence of iterative byzantine consensus algorithms. Additionally, we use our sufficient condition to examine whether such algorithms exist for some specific graphs.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.