Graph Minors and Parameterized Algorithm Design [chapter]

Dimitrios M. Thilikos
2012 Lecture Notes in Computer Science  
The Graph Minors Theory, developed by Robertson and Seymour, has been one of the most influential mathematical theories in parameterized algorithm design. We present some of the basic algorithmic techniques and methods that emerged from this theory. We discuss its direct meta-algorithmic consequences, we present the algorithmic applications of core theorems such as the grid-exclusion theorem, and we give a brief description of the irrelevant vertex technique.
doi:10.1007/978-3-642-30891-8_13 fatcat:56shhf7tevfdpczn4m7qir3zti