Rajendra P. Lal

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
A spanning tree T of a graph G is called a tree t-spanner if the distance between any two vertices in T is at most t-times their distance in G. A graph that has a tree t- spanner is called a tree t-spanner admissible graph. Given a graph G and an integer t, the tree t-spanner problem asks whether G admits a tree t-spanner. It is known that the tree(More)
  • 1