Faster Streaming algorithms for graph spanners

  title={Faster Streaming algorithms for graph spanners},
  author={Surender Baswana},
Given an undirected graph G = (V, E) onn vertices,m edges, and an integer t ≥ 1, a subgraph(V, ES), ES ⊆ E is called at-spanner if for any pair of vertices u, v ∈ V , the distance between them in the subgraph is at most t times the actual distance. We present streaming algorithms for computing at-spanner of essentially optimal size-stretch trade offs fo r… CONTINUE READING