Efficient algorithms for constructing (1+∊,β)-spanners in the distributed and streaming models

Abstract

For an unweighted undirected graph G = (V,E), and a pair of positive integers ý ý 1, β ý 0, a subgraph Gý = (V,H), H ýeqE, is called an (ý,β)-spanner of G if for every pair of vertices u,v ý V, dis...