SearchSkip to Search Results
- 1Bipartite permutation graphs
- 1Chain graphs
- 1IntD 410
- 1Minimum degree spanning trees
- 1Qualitative analysis
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...
Qualitative analysis was conducted on 30 written reflections completed by pre-service health science students enrolled in Interdisciplinary Team Development 410 at the University of Alberta. Five themes emerged from the analysis: (1) experience of cohesiveness, collaboration and communication of...