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:
“Two clergymen disputing whether ordination would be valid without the imposition of both hands, the more formal one said, “Do you think the Holy Dove could fly down with only one wing?””
—Horace Walpole (1717–1797)
“The man who knows governments most completely is he who troubles himself least about a definition which shall give their essence. Enjoying an intimate acquaintance with all their particularities in turn, he would naturally regard an abstract conception in which these were unified as a thing more misleading than enlightening.”
—William James (1842–1910)