Jump to content

Tree spanner

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by SmackBot (talk | contribs) at 22:30, 13 January 2007 (Date/fix the maintenance tags using AWB). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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 .