Graph Minors and Parameterized Algorithm Design - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Book Sections Year : 2012

Graph Minors and Parameterized Algorithm Design


The Graph Minors Theory, developed by Robertson and Sey-mour, has been one of the most influential mathematical theories in pa-rameterized 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 appli-cations of core theorems such as the grid-exclusion theorem, and we give a brief description of the irrelevant vertex technique.
Fichier principal
Vignette du fichier
minorsurvey.pdf (1 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

lirmm-01083542 , version 1 (17-11-2014)



Dimitrios M. Thilikos. Graph Minors and Parameterized Algorithm Design. The Multivariate Algorithmic Revolution and Beyond, LNCS (7370), pp.228-256, 2012, Essays Dedicated to Michael R. Fellows on the Occasion of His 60th Birthday - Part II, 978-3-642-30890-1. ⟨10.1007/978-3-642-30891-8_13⟩. ⟨lirmm-01083542⟩
141 View
327 Download



Gmail Facebook X LinkedIn More