Fast FPT-Algorithms for Cleaning Grids

DOI10.1007/11672142_29zbMath1136.68456OpenAlexW1594518100MaRDI QIDQ5449813

Dimitrios M. Thilikos, Josep Diaz

Publication date: 19 March 2008

Published in: STACS 2006 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11672142_29

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (10)

Parameterized Graph Cleaning Problems ⋮ Two edge modification problems without polynomial kernels ⋮ Cleaning interval graphs ⋮ Approximation and tidying -- a problem kernel for \(s\)-plex cluster vertex deletion ⋮ Contracting graphs to paths and trees ⋮ Parameterized complexity of Eulerian deletion problems ⋮ Parameterized graph cleaning problems ⋮ Parameterized complexity of finding regular induced subgraphs ⋮ Parameterized Complexity of Eulerian Deletion Problems ⋮ Two Edge Modification Problems without Polynomial Kernels

This page was built for publication: Fast FPT-Algorithms for Cleaning Grids