A win-win algorithm for the $(k+1)$-LST/$k$-pathwidth problem

Abstract

— We describe a Win/Win algorithm that produces in time polynomial in the size of a graph G and a given parameter k either a spanning tree with at least k + 1 leaves or a path decomposition of width at most k . This algorithm is optimal due to the path decomposition theorem.