Publication date
December 1981
DOI Publisher
North-Holland Publishing Company. Published by Elsevier B.V. ISSN
0304-3975 Citation count (estimate)
30Abstract
AbstractIn this paper, we give a solution of the Firing Squad Synchronization Problem for graphs. The synchronization times of solutions which have been obtained are proportional to the number of nodes of a graph. The synchronization time of our solution is proportional to the radius rG of a graph (G (3rG + 1 or 3rG time units, where rG, is the longest distance between the general and any other node of G. This synchronization time is minimum for an infinite number of graphs
Add to ORKG