English

Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs

Distributed, Parallel, and Cluster Computing 2012-02-06 v2

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.

Keywords

Cite

@article{arxiv.1201.4183,
  title  = {Iterative Approximate Byzantine Consensus in Arbitrary Directed Graphs},
  author = {Nitin Vaidya and Lewis Tseng and Guanfeng Liang},
  journal= {arXiv preprint arXiv:1201.4183},
  year   = {2012}
}
R2 v1 2026-06-21T20:07:20.418Z