Fig. 16From: Multi-hop Byzantine reliable broadcast with honest dealer made practicalMulti-shortest policy, varying the number of faults, message complexity, active omniscient Byzantines. n=100. a Random regular. b Multipartite wheel. ck-pasted-tree. dk-diamondBack to article page