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)
“No man, not even a doctor, ever gives any other definition of what a nurse should be than this—”devoted and obedient.” This definition would do just as well for a porter. It might even do for a horse. It would not do for a policeman.”
—Florence Nightingale (1820–1910)
Related Phrases
Related Words