An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion

Journal article

Peer reviewed

Mamadou Moustapha Kanté, Eun Jung Kim, O-Joung Kwon and Christophe Paul

Algorithmica, Vol.79(1), pp.66-95

09/2017

Abstract

Linear rankwidth

Rankwidth

Cliquewidth

Thread graph

Necklace graph

url

Find in HALView

1 Record Views

Title: An FPT Algorithm and a Polynomial Kernel for Linear Rankwidth-1 Vertex Deletion
Creators - without role: Mamadou Moustapha Kanté - Université Clermont Auvergne
Eun Jung Kim - Université Paris Dauphine-PSL
O-Joung Kwon - Hungarian Academy of Sciences
Christophe Paul - Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier
Publication Details: Algorithmica, Vol.79(1), pp.66-95
Identifiers: 9941053309311
Academic Unit: Laboratoire d'Informatique de Robotique et de Microélectronique de Mtp - LIRMM
Language: English
Resource Type: Journal article
Local Fields: lirmm-01692676