10 citations · 18 across the 4 of their papers we have counts for
4 papers
On approximating tree spanners that are breadth first search trees
Ioannis Papoutsakis
A tree -spanner of a graph is a spanning tree of such that the distance in between every pair of verices is at most times the distance in between them. T…
Tree spanners of small diameter
Ioannis Papoutsakis
A graph that contains a spanning tree of diameter at most clearly admits a tree -spanner, since a tree -spanner of a graph is a sub tree of such that the distance…
Tree spanners of bounded degree graphs
Ioannis Papoutsakis
A tree -spanner of a graph is a spanning tree of such that the distance between pairs of vertices in the tree is at most times their distance in . Deciding tree $…
Tree 3-spanners of diameter at most 5
Ioannis Papoutsakis
Tree spanners approximate distances within graphs; a subtree of a graph is a tree -spanner of the graph if and only if for every pair of vertices their distance in the subtree i…