Download the full-sized PDF of Minimum Degree Spanning Trees on Bipartite Permutation GraphsDownload the full-sized PDF



Permanent link (DOI):


Export to: EndNote  |  Zotero  |  Mendeley


This file is in the following communities:

Graduate Studies and Research, Faculty of


This file is in the following collections:

Theses and Dissertations

Minimum Degree Spanning Trees on Bipartite Permutation Graphs Open Access


Other title
chain graphs
minimum degree spanning trees
bipartite permutation graphs
Type of item
Degree grantor
University of Alberta
Author or creator
Smith, Jacqueline
Supervisor and department
Stewart, Lorna (Computing Science)
Examining committee member and department
Cliff, Gerald (Mathematical and Statistical Sciences)
Culberson, Joseph (Computing Science)
Department of Computing Science

Date accepted
Graduation date
Master of Science
Degree level
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 has been done studying graph classes where this problem may be polynomial time solvable. The Hamiltonian path problem has been widely studied on graph classes, and we use classes with polynomial time results for the Hamiltonian path problem as a starting point for graph class results for the minimum degree spanning tree problem. We show the minimum degree spanning tree problem is polynomial time solvable for chain graphs. We then show this problem is polynomial time solvable on bipartite permutation graphs, and that there exist minimum degree spanning trees of these graphs that are caterpillars, and that have other particular structural properties.
License granted by Jacqueline Smith ( on 2011-04-14T18:48:04Z (GMT): Permission is hereby granted to the University of Alberta Libraries to reproduce single copies of this thesis and to lend or sell such copies for private, scholarly or scientific research purposes only. Where the thesis is converted to, or otherwise made available in digital form, the University of Alberta will advise potential users of the thesis of the above terms. The author reserves all other publication and other rights in association with the copyright in the thesis, and except as herein provided, neither the thesis nor any substantial portion thereof may be printed or otherwise reproduced in any material form whatsoever without the author's prior written permission.
Citation for previous publication

File Details

Date Uploaded
Date Modified
Audit Status
Audits have not yet been run on this file.
File format: pdf (Portable Document Format)
Mime type: application/pdf
File size: 4943465
Last modified: 2015:10:12 18:47:24-06:00
Filename: Smith_Jacqueline_Spring 2011.pdf
Original checksum: 440861159d74121753c0a377574c196b
Well formed: false
Valid: false
Status message: Lexical error offset=4933688
Page count: 111
Activity of users you follow
User Activity Date