#### Filter Results:

- Full text PDF available (0)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Anita Das, Bhawani Sankar Panda, Rajendra P. Lal
- 9th International Conference on Information…
- 2006

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
- ›