# A simple linear time algorithm for computing a (2k - 1)-spanner of o(n 1+1/k ) size in weighted graphs

##### Citations

618 citations

563 citations

202 citations

### Cites methods from "A simple linear time algorithm for ..."

...Due to lack of space we cannot describe here the deterministic version of the linear time spanner construction algorithm of Baswana and Sen [ 5 ]....

[...]

...The techniques we use to obtain the new deterministic algorithm can also be used to derandomize the expected linear time algorithm of Baswana and Sen [ 5 ] for constructing (2k − 1)-spanners of size O(kn 1+1/k ), retaining the linear running time and the O(kn 1+1/k ) size of the spanners....

[...]

200 citations

175 citations

##### References

762 citations

### "A simple linear time algorithm for ..." refers background in this paper

...the design of synchronizers [2] and design of succinct...

[...]

...For other numerous applications, please refer to the papers [1,2,9,10]....

[...]

654 citations

### "A simple linear time algorithm for ..." refers background or methods in this paper

...Previously a number of papers [1,6,11] had addressed the problem of computing sparse spanners of graphs efficiently....

[...]

...For other numerous applications, please refer to the papers [1,2,9,10]....

[...]

...[1]....

[...]

...All the existing algorithms require computation of shortest distance information between many pairs of vertices [1], or computing shortest path trees from a set of (n1/k) vertices [11]....

[...]

563 citations

437 citations

402 citations

### Additional excerpts

...For other numerous applications, please refer to the papers [1,2,9, 10 ]....

[...]