Lossy Kernels for Graph Contraction Problems
From MaRDI portal
Publication:4636570
DOI10.4230/LIPIcs.FSTTCS.2016.23zbMath1391.68059OpenAlexW2579312895MaRDI QIDQ4636570
Ashutosh Rai, Pranabendu Misra, R. Krithika, Prafullkumar Tale
Publication date: 19 April 2018
Full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2016/6858/pdf/LIPIcs-FSTTCS-2016-23.pdf/
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Related Items (12)
On the parameterized complexity of maximum degree contraction problem ⋮ Unnamed Item ⋮ On the parameterized complexity of grid contraction ⋮ On approximate data reduction for the Rural Postman Problem: Theory and experiments ⋮ A single exponential-time FPT algorithm for cactus contraction ⋮ On the Parameterized Complexity of Maximum Degree Contraction Problem. ⋮ Lossy kernelization of same-size clustering ⋮ Unnamed Item ⋮ Reducing graph transversals via edge contractions ⋮ Parameterized Approximation Algorithms for Bidirected Steiner Network Problems ⋮ Lossy kernelization of same-size clustering ⋮ On the Parameterized Approximability of Contraction to Classes of Chordal Graphs
This page was built for publication: Lossy Kernels for Graph Contraction Problems
