Byzantine gathering in networks


This paper investigates an open problem introduced in Dieudonné et al. (ACM Trans Algorithms 11(1):1, 2014). Two or more mobile agents start from nodes of a network and have to accomplish the task of gathering which consists in getting all together at the same node at the same time. An adversary chooses the initial nodes of the agents and assigns a… (More)
DOI: 10.1007/s00446-016-0276-9

1 Figure or Table


  • Presentations referencing similar topics