Tree spanner
Appearance
A tree -spanner of a graph is a spanning subtree of in which the distance between every pair of vertices is at most times their distance in .
A tree -spanner of a graph
is a spanning subtree
of
in which the distance between every pair of vertices is at most
times their distance in
.
![]() | This mathematics-related article is a stub. You can help Wikipedia by expanding it. |