In graph theory, a degree-constrained spanning tree is a spanning tree where the maximum vertex degree is limited to a certain constant k. The degree-constrained spanning tree problem is to determine whether a particular graph has such a spanning tree for a particular k.
Read more about Degree-constrained Spanning Tree: Formal Definition, NP-completeness, Degree-constrained Minimum Spanning Tree, Approximation Algorithm
Famous quotes containing the word tree:
“The problems of the world, AIDS, cancer, nuclear war, pollution, are, finally, no more solvable than the problem of a tree which has borne fruit: the apples are overripe and they are falling—what can be done?... Nothing can be done, and nothing needs to be done. Something is being done—the organism is preparing to rest.”
—David Mamet (b. 1947)