Strong Parameterized Deletion: Bipartite Graphs

DOI10.4230/LIPIcs.FSTTCS.2016.21zbMath1391.68092OpenAlexW2573875671MaRDI QIDQ4636568

M. S. Ramanujan, Ashutosh Rai

Publication date: 19 April 2018

Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6856/pdf/LIPIcs-FSTTCS-2016-21.pdf/

zbMATH Keywords

fixed-parameter tractablebipartite-editingrecursive understanding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel ⋮ Deletion to scattered graph classes. I: Case of finite number of graph classes ⋮ Unnamed Item ⋮ Reducing CMSO model checking to highly connected graphs

This page was built for publication: Strong Parameterized Deletion: Bipartite Graphs