Clique-width Minimization is NP-hard

Fellows, Michael R.; Rosamond, Frances A.; Rotics, Udi; Szeider, Stefan

doi:10.1145/1132516.1132568

by Michael R. Fellows, Frances A. Rosamond, Udi Rotics, Stefan Szeider

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.

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},
  doi = {10.1145/1132516.1132568},
publisher =	 {ACM},
  pages =	 {354--362},
}