Learn More

A spanner of a graph is a sparse subgraph that approximately preserves distances in the original graph. More precisely, a subgraph H = (V, E H) is a k-spanner of a graph G = (V, E) if for every pair of vertices u, v ∈ V , the shortest path distance dist H (u, v) from u to v in H is at most k · dist G (u, v). We focus on spanners of directed graphs and a… (More)

- ‹
- 1
- ›