Search
Skip to Search Results
Filter
Subject / Keyword
Departments
Collections
Supervisors
Author / Creator / Contributor
Year
Languages
Item type
Subject: Bipartite permutation graphs
Subject: Chain graphs
Subject: Minimum degree spanning trees
Departments: Department of Computing Science
Collections: Graduate and Postdoctoral Studies (GPS), Faculty of
Collections: Graduate and Postdoctoral Studies (GPS), Faculty of/Theses and Dissertations
Supervisors: Stewart, Lorna (Computing Science)
-
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