Clique-width Minimization is NP-hard (bibtex)
by , , ,
Reference:
Clique-width Minimization is NP-hardMichael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan SzeiderProceedings of STOC 2006; the 38th ACM Symposium on Theory of Computing, Seattle, Washington, USA, pages 354-362, 2006, Assoc. Comput. Mach., New York.Note: Full version appeared in the SIAM Journal on Discrete Mathematics vol. 23, no. 2, pp. 909-939, 2009
Bibtex Entry:
@string{acm="Assoc. Comput. Mach., New York"}
@InProceedings{FellowsRosamondRoticsSzeider06,
Author =	 {Michael R. Fellows and Frances A. Rosamond and Udi Rotics
and Stefan Szeider},
title =	 {Clique-width Minimization is {NP}-hard},
booktitle =	 {Proceedings of STOC 2006; the 38th ACM Symposium on Theory
of Computing, Seattle, Washington, USA},
year =	 {2006},
publisher =	 {ACM},
pages =	 {354-362},
note =	 {Full version appeared in the SIAM Journal on Discrete
Mathematics vol. 23, no. 2, pp. 909-939, 2009},
}