Clique Cover and Graph Separation: New Incompressibility Results
From MaRDI portal
Publication:2843253
DOI10.1007/978-3-642-31594-7_22zbMath1272.68152arXiv1111.0570MaRDI QIDQ2843253
Marek Cygan, Marcin Pilipczuk, Michał Pilipczuk, Stefan Kratsch, 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
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
