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:
“You are wind in a stark tree,
you are the stark tree unbent,
you are a strung bow,
you are an arrow.”
—Hilda Doolittle (1886–1961)
Related Phrases
Related Words