b -Matchings in Trees
S. E. Goodman, Stephen T. Hedetniemi, Robert Endre Tarjan · SIAM Journal on Computing · 1976
We develop linear-time algorithms to find maximum weighted and unweighted degree-constrained subgraphs (b-matchings) of a tree. We use a generalization of an algorithm for finding a maximum 2-matching in a tree.