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:
“Here is a hero who did nothing but shake the tree as soon as the fruit was ripe. Does this seem to be too small a thing to you? Then take a good look at the tree he shook.”
—Friedrich Nietzsche (1844–1900)