Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion

Journal article

Peer reviewed

Julien Baste, Luerbio Faria, Sulamita Klein and Ignasi Sau

Theory of Computing Systems, Vol.61(3), pp.777-794

10/2017

Abstract

Graph modification problem

Parameterized complexity

Iterative compression

FPT-algorithm

Single-exponential algorithm

url

Find in HALView

1 Record Views

Title: Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion
Creators - without role: Julien Baste - Centre National de la Recherche Scientifique
Luerbio Faria - Universidade do Estado do Rio de Janeiro
Sulamita Klein - Universidade Federal do Rio de Janeiro
Ignasi Sau - Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier
Publication Details: Theory of Computing Systems, Vol.61(3), pp.777-794
Identifiers: 9943958909311
Academic Unit: Laboratoire d'Informatique de Robotique et de Microélectronique de Mtp - LIRMM
Language: English
Resource Type: Journal article
Local Fields: lirmm-01630773