  We investigate the problem of obtaining agreement protocols in the presence
of a mobile adversary, who can control an ever-changing selection of
processors. We make improvements to previous results for the case when the
communications network forms a complete graph, and also adapt these to the
general case when the network is not complete.
