Clique-width Minimization is NP-hard

Michael Fellows, Frances Rosamond, U Rotics, Stefan Szeider

Research output: Chapter in Book/Report/Conference proceeding › Conference Paper published in Proceedings › peer-review

Original language	English
Title of host publication	Proceedings of the Annual ACM Symposium on Theory of Computing
Place of Publication	unknown
Publisher	Association for Computing Machinery (ACM)
Pages	-
Number of pages	9
ISBN (Print)	0737-8017
Publication status	Published - 2006
Event	STOC'06. 38th Annual ACM Symposium on Theory of Computing - Seattle, USA Duration: 21 May 2006 → 23 May 2006

Conference	STOC'06. 38th Annual ACM Symposium on Theory of Computing
Period	21/05/06 → 23/05/06

Cite this

@inproceedings{70a010c5754244e7a3659f125e88e503,

title = "Clique-width Minimization is NP-hard",

author = "Michael Fellows and Frances Rosamond and U Rotics and Stefan Szeider",

year = "2006",

language = "English",

isbn = "0737-8017",

pages = "--",

booktitle = "Proceedings of the Annual ACM Symposium on Theory of Computing",

publisher = "Association for Computing Machinery (ACM)",

address = "United States",

note = "STOC'06. 38th Annual ACM Symposium on Theory of Computing ; Conference date: 21-05-2006 Through 23-05-2006",

}

TY - GEN

T1 - Clique-width Minimization is NP-hard

AU - Fellows, Michael

AU - Rosamond, Frances

AU - Rotics, U

AU - Szeider, Stefan

PY - 2006

Y1 - 2006

M3 - Conference Paper published in Proceedings

SN - 0737-8017

SP - -

BT - Proceedings of the Annual ACM Symposium on Theory of Computing

PB - Association for Computing Machinery (ACM)

CY - unknown

T2 - STOC'06. 38th Annual ACM Symposium on Theory of Computing

Y2 - 21 May 2006 through 23 May 2006

ER -