Graph spanners

Abstract

Abstract Given a graph G = (V, E) , a subgraph Gapos; = (V, Eapos;) is a t‐ spanner of G if for every u, v ∈ V , the distance from u to v in Gapos; is at most t times longer than that distance in G. This paper presents some results concerning the existence and efficient constructability of sparse spanners for various classes of graphs, including general undirected graphs, undirected chordal graphs, and general directed graphs.