Parameterized Algorithms by Cygan, Fomin, Kowalik, Lokshtanov, Marx, Pilipczuk, Pilipczuk, Saurabh

https://www.doi.org/10.1007/978-3-319-21275-3

@book{ParameterizedAlgorithms2015,
author = {Marek Cygan and
               Fedor V. Fomin and
               Łukasz Kowalik and
               Daniel Lokshtanov and
               D{á}niel Marx and
               Marcin Pilipczuk and
               Michał Pilipczuk and
               Saket Saurabh},
doi = {10.1007/978-3-319-21275-3},
isbn = {978-3-319-21274-6},
publisher = {Springer},
title = {Parameterized Algorithms},
year = {2015},
}

• treewidth – Very roughly, treewidth captures how similar a graph is to a tree. There are many ways to define ``tree-likeness’’ of a graph; … it appears that the approach most useful from algorithmic and graph theoretical perspectives, is to view tree-likeness of a graph $G$ as the existence of a structural decomposition of $G$ into pieces of bounded size that are connected in a tree-like fashion. This intuitive concept is formalized via the notions of a tree decomposition and the treewidth of a graph; the latter is a quantitative measure of how good a tree decomposition we can possibly obtain.