The firing squad synchronization problem for graphs

Yasuaki Nishitani, Namio Honda
1981 Theoretical Computer Science  
tn this paper, we give a solution of the Firing Squad Synchronization Problem for graphs. The synchronization *imes of solutions which have been obtained are proportional to the number or nodes of a graph. T~e synchronization time of our solution is proport[onal to the radius rG of a graph G (3re; + 1 or 3rG time units), where rG is the longest distance between the general and any other node of G. This synchronization time is m[,~imum for an infinite number of graphs.
doi:10.1016/0304-3975(81)90004-9 fatcat:d2qt7h3lujfoxcc633rjfi5szq