The Norms of Graph Spanners

ICALP, 2019.

Cited by: 0|Bibtex|Views8|Links
EI

Abstract:

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 Althofer 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. But for some settings the more interesting notion is not the n...More

Code:

Data:

Your rating :
0

 

Tags
Comments