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

Michael R. Fellows et al. (2005)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2022-09-28

a service of  Schloss Dagstuhl - Leibniz Center for Informatics