Clique-width Minimization is NP-hard

Michael Fellows, Frances Rosamond, U Rotics, Stefan Szeider

    Research output: Chapter in Book/Report/Conference proceedingConference Paper published in Proceedings

    Original languageEnglish
    Title of host publicationProceedings of the Annual ACM Symposium on Theory of Computing
    Place of Publicationunknown
    PublisherAssociation for Computing Machinery (ACM)
    Pages-
    Number of pages9
    ISBN (Print)0737-8017
    Publication statusPublished - 2006
    EventSTOC'06. 38th Annual ACM Symposium on Theory of Computing - Seattle, USA
    Duration: 21 May 200623 May 2006

    Conference

    ConferenceSTOC'06. 38th Annual ACM Symposium on Theory of Computing
    Period21/05/0623/05/06

    Cite this

    Fellows, M., Rosamond, F., Rotics, U., & Szeider, S. (2006). Clique-width Minimization is NP-hard. In Proceedings of the Annual ACM Symposium on Theory of Computing (pp. -). unknown: Association for Computing Machinery (ACM).