scientific article; zbMATH DE number 6861888

DOI10.4230/LIPIcs.APPROX-RANDOM.2016.3zbMath1398.68188arXiv1606.02688MaRDI QIDQ4636433

Michał Pilipczuk, Paweł Komosa, Marek Cygan, Ivan A. Bliznets

Publication date: 19 April 2018

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

hardness of approximationparameterized complexitykernelizationedge modification problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Partitioning a graph into small pieces with applications to path transversal

This page was built for publication: