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

DOI10.4230/LIPIcs.IPEC.2015.138zbMath1372.68130arXiv1504.05905OpenAlexW2962934758MaRDI QIDQ5363767

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

Publication date: 29 September 2017

Full work available at URL: https://arxiv.org/abs/1504.05905

zbMATH Keywords

distance-hereditary graphsparameterized complexitykernelization(linear) rankwidththread graphs

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

An FPT algorithm and a polynomial kernel for linear rankwidth-1 vertex deletion