Tree spanner

The lowest $k$ tree spanner for the graph $G$ is $k=3/2$ because of the necessarily longer path between vertices 2 and 3, which is $3/2$ times as long as the shortest distance between them in $G$

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$.

Known Results

There are several papers written on the subject of tree spanners. One of these was entitled Tree Spanners written by mathematicians Leizhen Cai and Derek Corneil, which explored theoretical and algorithmic problems associated with tree spanners. Some of the conclusions from that paper are listed below. $n$ is always the number of vertices of the graph, and $m$ is its number of edges.

1. A tree 1-spanner, if it exists, is a minimum spanning tree and can be found in $𝒪(m\log \beta (m,n))$ time (in terms of complexity) for a weighted graph, where $\beta (m,n)=\min \{i\mid {\log }^{i}n\le m/n\}$. Furthermore, every tree 1-spanner admissible weighted graph contains a unique minimum spanning tree.
2. A tree 2-spanner can be constructed in $𝒪(m+n)$ time, and the tree $t$-spanner problem is NP-complete for any fixed integer $t>3$.
3. The complexity for finding a minimum tree spanner in a digraph is $𝒪((m+n)\cdot \alpha (m+n,n))$, where $\alpha (m+n,n)$ is a functional inverse of the Ackermann function
4. The minimum 1-spanner of a weighted graph can be found in $𝒪(mn+n^2\log (n))$ time.
5. For any fixed rational number $t>1$, it is NP-complete to determine whether a weighted graph contains a tree t-spanner, even if all edge weights are positive integers.
6. A tree spanner (or a minimum tree spanner) of a digraph can be found in linear time.
7. A digraph contains at most one tree spanner.
8. The quasi-tree spanner of a weighted digraph can be found in $𝒪(m\log \beta (m,n))$ time.

See also

• Graph spanner
• Geometric spanner

References

• Template:Citation.