For a constant t [[EQUATION]] 1, a t-spanner of a connected graph G is a spanning subgraph of G in which the distance between any pair of vertices is at most t times its distance in G. This concept, introduced by Peleg and Ullman in 1989, was used in the construction of an optimal synchronizer...