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:
“Everyone who enjoys supposes that the tree was concerned with the fruit, but it was really concerned with the seed.—In this lies the difference between all those who create and those who enjoy.”
—Friedrich Nietzsche (1844–1900)
Related Phrases
Related Words