Graph spanners

David Peleg, Alejandro A. Schäffer

Research output: Contribution to journalArticlepeer-review

478 Scopus citations


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.

Original languageEnglish
Pages (from-to)99-116
Number of pages18
JournalJournal of Graph Theory
Issue number1
StatePublished - Mar 1989
Externally publishedYes


Dive into the research topics of 'Graph spanners'. Together they form a unique fingerprint.

Cite this