2 research outputs found
Spanning Trees with Bounded Number of Branch Vertices
We introduce the following combinatorial optimization problem: Given a connected graph G, find a spanning tree T of G with the smallest number of branchv ertices (vertices of degree 3 or more in T). The problem is motivated by new technologies in the realm of optical networks. We investigate algorithmic and combinatorial aspects of the problem