The Firing Squad Synchronization Problem for Graphs

Abstract

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

13 Figures and Tables

Statistics

0510'87'90'93'96'99'02'05'08'11'14'17
Citations per Year

72 Citations

Semantic Scholar estimates that this publication has 72 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Nishitani1981TheFS, title={The Firing Squad Synchronization Problem for Graphs}, author={Yasuaki Nishitani and Namio Honda}, journal={Theor. Comput. Sci.}, year={1981}, volume={14}, pages={39-61} }