Computation of a Tree 3-Spanner on Trapezoid Graphs
Discrete Mathematics
2014-08-12 v2
Abstract
In a graph, a spanning tree is said to be a tree t-spanner of the graph if the distance between any two vertices in is at most times their distance in . The tree t-spanner has many applications in networks and distributed environments. In this paper, an algorithm is presented to find a tree -spanner on trapezoid graphs in time, where is the number of vertices of the graph.
Cite
@article{arxiv.1407.8132,
title = {Computation of a Tree 3-Spanner on Trapezoid Graphs},
author = {Sambhu Charan Barman and Sukumar Mondal and Madhumangal Pal},
journal= {arXiv preprint arXiv:1407.8132},
year = {2014}
}
Comments
16 pages