Tree spanner

From Wikipedia, the free encyclopedia

A tree k-spanner (or simply k-spanner) of a graph G is a spanning subtree T of G in which the distance between every pair of vertices is at most k times their distance in G.


This combinatorics-related article is a stub. You can help Wikipedia by expanding it.