Search

• < Previous
• 1
• 2
• Next >

Optimizing tree decompositions in MSO

The classic algorithm of Bodlaender and Kloks [J. Algorithms, 1996] solves the following problem in linear fixed-parameter time: given a tree decomposition of a graph of (possibly suboptimal) width k, compute an optimum-width tree decomposition of the graph. In this work, we prove that this problem&nbsp;[&hellip;]