This is a decommissioned version of ERA which is running to enable completion of migration processes. All new collections and items and all edits to existing items should go to our new ERA instance at https://ualberta.scholaris.ca - Please contact us at erahelp@ualberta.ca for assistance!
Search
Skip to Search Results
Filter
Subject / Keyword
Supervisors
Author / Creator / Contributor
Year
Collections
Languages
Item type
Departments
-
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