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

Julien Baste; Luerbio Faria; Sulamita Klein; Ignasi Sau

doi:10.1007/s00224-016-9716-y

Journal Articles Theory of Computing Systems Year : 2017

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

(1) , (2) , (3) , (1)

1
2
3

Julien Baste

Function : Author
PersonId : 12790
IdHAL : baste
ORCID : 0000-0002-7869-0959
IdRef : 23241291X

Algorithmes, Graphes et Combinatoire

Luerbio Faria

Function : Author

Universidade do Estado do Rio de Janeiro [Brasil] = Rio de Janeiro State University [Brazil] = Université d'État de Rio de Janeiro [Brésil]

Sulamita Klein

Function : Author

Departamento de Ciência Da Computação [Rio de Janeiro]

Ignasi Sau

Function : Author
PersonId : 7331
IdHAL : ignasi-sau
ORCID : 0000-0002-8981-9287
IdRef : 137767420

Algorithmes, Graphes et Combinatoire

CV

Keywords

Graph modification problem Parameterized complexity Iterative compression FPT-algorithm Single-exponential algorithm

Domains

Mathematics [math]

Ignasi Sau : Connect in order to contact the contributor

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01630773

Submitted on : Wednesday, November 8, 2017-10:47:38 AM

Last modification on : Monday, April 22, 2024-12:44:30 PM

Dates and versions

lirmm-01630773 , version 1 (08-11-2017)

Identifiers

HAL Id : lirmm-01630773 , version 1
ARXIV : 1504.05515v2
DOI : 10.1007/s00224-016-9716-y

Cite

Julien Baste, Luerbio Faria, Sulamita Klein, Ignasi Sau. Parameterized Complexity Dichotomy for (r, ℓ)-Vertex Deletion. Theory of Computing Systems, 2017, 61 (3), pp.777-794. ⟨10.1007/s00224-016-9716-y⟩. ⟨lirmm-01630773⟩

Export

BibTeX XML-TEI Dublin Core DC Terms EndNote DataCite

Collections

CNRS ALGCO LIRMM MIPS UNIV-MONTPELLIER

188 View

0 Download

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

Keywords

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Altmetric

Share