Jump to content

Tree spanner

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Erik9bot (talk | contribs) at 17:26, 16 August 2009 (add Category:Articles lacking sources (Erik9bot)). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

A tree k-spanner (or simply k-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 .


Stub icon

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

Retrieved from "https://en.wikipedia.org/w/index.php?title=Tree_spanner&oldid=308323744"