Degree-constrained Spanning Tree - Degree-constrained Minimum Spanning Tree

Degree-constrained Minimum Spanning Tree

On a weighted graph, a Degree-constrained minimum spanning tree (DCMST) is a degree-constrained spanning tree in which the sum of its edges has the minimum possible sum. Finding a DCMST is an NP-Hard problem.

Heuristic algorithms that can solve the problem in polynomial time have been proposed, including Genetic and Ant-Based Algorithms.

Read more about this topic:  Degree-constrained Spanning Tree

Famous quotes containing the words minimum and/or tree:

    After decades of unappreciated drudgery, American women just don’t do housework any more—that is, beyond the minimum that is required in order to clear a path from the bedroom to the front door so they can get off to work in the mourning.
    Barbara Ehrenreich (20th century)

    Either make the tree good, and its fruit good; or make the tree bad, and its fruit bad; for the tree is known by its fruit.
    Bible: New Testament, Matthew 12:33.