Proving NP-hardness for clique-width II: non-approximability of clique-width

Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider. Proving NP-hardness for clique-width II: non-approximability of clique-width. Electronic Colloquium on Computational Complexity (ECCC), (081), 2005. [doi]

Abstract

Abstract is missing.