Formal Definition
Input: n-node undirected graph G(V,E); positive integer k ≤ n.
Question: Does G have a spanning tree in which no node has degree greater than k?
Read more about this topic: Degree-constrained Spanning Tree
Famous quotes containing the words formal and/or definition:
“On every formal visit a child ought to be of the party, by way of provision for discourse.”
—Jane Austen (1775–1817)
“It is very hard to give a just definition of love. The most we can say of it is this: that in the soul, it is a desire to rule; in the spirit, it is a sympathy; and in the body, it is but a hidden and subtle desire to possess—after many mysteries—what one loves.”
—François, Duc De La Rochefoucauld (1613–1680)
Related Phrases
Related Words