This thesis introduces an algorithm for finding a minimum vertex-ranking spanning tree of a partial k-tree. A vertex-ranking of a graph G is a labeling of its vertices with positive integers such that every path between ...