@article{oai:tsukuba.repo.nii.ac.jp:00019876,
author = {繁野, 麻衣子 and Ichimura, Akira and Shigeno, Maiko},
issue = {12-13},
journal = {Information processing letters},
month = {Jun},
note = {This paper deals with broadcasting in a network with t-locally bounded Byzantine faults. One of the simplest broadcasting algorithms under Byzantine failures is referred to as a certified propagation algorithm (CPA), which is the only algorithm we know that does not use any global knowledge of the network topology. Hence, it is worth focusing on a graph-theoretic parameter such that CPA will work correctly. Using the theory of maximum adjacency (MA) ordering, a new graph-theoretic parameter for CPA is proposed. Within a factor of two, this parameter approximates the largest t such that CPA works for t-locally bounded Byzantine faults.},
pages = {514--517},
title = {A new parameter for a broadcast algorithm with locally bounded Byzantine faults},
volume = {110},
year = {2010}
}