2 research outputs found
Tree spanners of bounded degree graphs
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 -spanner admissible graphs has been proved to
be tractable for , while the complexity status
of this problem is unresolved when . For every and , an
efficient dynamic programming algorithm to decide tree -spanner
admissibility of graphs with vertex degrees less than is presented. Only
for , the algorithm remains efficient, when graphs with degrees less
than are examined
Collective Additive Tree Spanners of Bounded Tree-Breadth Graphs with Generalizations and Consequences
In this paper, we study collective additive tree spanners for families of
graphs enjoying special Robertson-Seymour's tree-decompositions, and
demonstrate interesting consequences of obtained results. We say that a graph
{\em admits a system of collective additive tree -spanners}
(resp., {\em multiplicative tree -spanners}) if there is a system \cT(G)
of at most spanning trees of such that for any two vertices of
a spanning tree T\in \cT(G) exists such that
(resp., ). When one gets the notion of
{\em additive tree -spanner} (resp., {\em multiplicative tree -spanner}).
It is known that if a graph has a multiplicative tree -spanner, then
admits a Robertson-Seymour's tree-decomposition with bags of radius at most
in . We use this to demonstrate that there is a
polynomial time algorithm that, given an -vertex graph admitting a
multiplicative tree -spanner, constructs a system of at most
collective additive tree -spanners of . That is, with a slight
increase in the number of trees and in the stretch, one can "turn" a
multiplicative tree spanner into a small set of collective additive tree
spanners. We extend this result by showing that if a graph admits a
multiplicative -spanner with tree-width , then admits a
Robertson-Seymour's tree-decomposition each bag of which can be covered with at
most disks of of radius at most each. This is used
to demonstrate that, for every fixed , there is a polynomial time algorithm
that, given an -vertex graph admitting a multiplicative -spanner with
tree-width , constructs a system of at most collective
additive tree -spanners of .Comment: 21 pages, 4 figure