Fig. 12From: Multi-hop Byzantine reliable broadcast with honest dealer made practicalMulti-shortest policy, message complexity with either passive or non-omniscient (general) Byzantine. n=100, f=⌊(k−1)/2⌋, bounded channels. a Random regular. b Multipartite wheel. ck-pasted-tree. dk-diamondBack to article page