Abstract

This thesis focuses on problems related to treewidth and pathwidth of graphs.
Many problems are difficult to solve for graphs in general. The treewidth of a graph is
a good indication whether one can obtain a solution within reasonable time. A
necessary ingredient is a treedecomposition of the graph with small width.
Equivalently, one
... read more