By Eden Chlamtáč and others

A $t$-spanner of a graph $G$ is a subgraph $H$ in which all distances are preserved up to a multiplicative $t$ factor. A classical result of Alth\"ofer et al. is that for every integer $k$ and every graph $G$, there is a $(2k-1)$-spanner of $G$ with at most $O(n^{1+1/k})$ edges.... Show more

March 18, 2019

Loading full text...

Similar articles

Loading recommendations...

x1

The Norms of Graph Spanners

Click on play to start listening