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

Linear rankwidth is a linearized variant of rankwidth, introduced by Oum and Seymour (J Comb Theory Ser B 96(4):514–528, 2006 ). Motivated from recent development on graph modification problems regarding classes of graphs of bounded treewidth or pathwidth, we study the Linear Rankwidth - 1 Vertex De...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Algorithmica 2017-09, Vol.79 (1), p.66-95
Hauptverfasser:	Kanté, Mamadou Moustapha, Kim, Eun Jung, Kwon, O-joung, Paul, Christophe
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Deletion Discrete Mathematics Graph theory Graphs Mathematics of Computing Run time (computers) Theory of Computation
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!