Search
Skip to Search Results
Filter
Subject / Keyword
Departments
Item type
Languages
Author / Creator / Contributor
Year
Collections
Supervisors
-
Spring 2011
The minimum degree spanning tree problem is a widely studied NP-hard variation of the minimum spanning tree problem, and a generalization of the Hamiltonian path problem. Most of the work done on the minimum degree spanning tree problem has been on approximation algorithms, and very little work...
1 - 1 of 1