Clique Cover and Graph Separation: New Incompressibility Results
From MaRDI portal
Publication:2843253
DOI10.1007/978-3-642-31594-7_22zbMath1272.68152arXiv1111.0570OpenAlexW2153916899MaRDI QIDQ2843253
Stefan Kratsch, Michał Pilipczuk, Marcin Pilipczuk, Marek Cygan, Magnus Wahlström
Publication date: 12 August 2013
Published in: Automata, Languages, and Programming (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.0570
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Related Items (3)
Kernelization – Preprocessing with a Guarantee ⋮ Multicut Is FPT ⋮ On the complete width and edge clique cover problems
This page was built for publication: Clique Cover and Graph Separation: New Incompressibility Results
