Showing papers on "Minimum degree spanning tree published in 1982"
TL;DR: It is shown that the complexity of the foUowmg class of problems depends explicitly on the rate of growth of a sLmple parameter of the family of prototypes.
Abstract: The complexity of the foUowmg class of problems Is investigated: Given a distance matrix, fred the shortest spanning tree that is isomorphic to a given prototype. Several classical combinatorial problems, both easy and hard, fall into this category for an appropriate choice of the family of prototypes, for example, taking the family to be the set of all paths gives the traveling salesman problem or taking the family to be the set of all 2-stars gives the weighted matching problem It is shown that the complexity of these problems depends explicitly on the rate of growth of a sLmple parameter of the family of prototypes.
184 citations
65 citations
TL;DR: A linear-time algorithm for determining the number of b-matching in a tree is presented and it is shown that finding a b- matching is equivalent to finding a spanning subgraph in which the degree of each vertex v is at most b(v).
1 citations
TL;DR: It is observed that any msf 9 is entirely composed of stars, and the problem of determining an msf can be seen as a special case of the degree constrained subgraph problem, and therefore is solvable in O(]V] 3, steps.