TY - JOUR
T1 - Graph spanners
AU - Peleg, David
AU - Schäffer, Alejandro A.
PY - 1989/3
Y1 - 1989/3
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=0002499613&partnerID=8YFLogxK
U2 - 10.1002/jgt.3190130114
DO - 10.1002/jgt.3190130114
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0002499613
SN - 0364-9024
VL - 13
SP - 99
EP - 116
JO - Journal of Graph Theory
JF - Journal of Graph Theory
IS - 1
ER -