A natural generalization of bounded tree-width and bounded clique-width

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    2 Scopus citations

    Abstract

    We investigate a new width parameter, the fusion-width of a graph. It is a natural generalization of the tree-width, yet strong enough that not only graphs of bounded tree-width, but also graphs of bounded clique-width, trivially have bounded fusion-width. In particular, there is no exponential growth between tree-width and fusion-width, as is the case between tree-width and clique-width. The new parameter gives a good intuition about the relationship between tree-width and clique-width.

    Original languageEnglish (US)
    Title of host publicationLATIN 2014
    Subtitle of host publicationTheoretical Informatics - 11th Latin American Symposium, Proceedings
    PublisherSpringer Verlag
    Pages72-83
    Number of pages12
    ISBN (Print)9783642544224
    DOIs
    StatePublished - Jan 1 2014
    Event11th Latin American Theoretical Informatics Symposium, LATIN 2014 - Montevideo, Uruguay
    Duration: Mar 31 2014Apr 4 2014

    Publication series

    NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
    Volume8392 LNCS
    ISSN (Print)0302-9743
    ISSN (Electronic)1611-3349

    Other

    Other11th Latin American Theoretical Informatics Symposium, LATIN 2014
    CountryUruguay
    CityMontevideo
    Period3/31/144/4/14

    All Science Journal Classification (ASJC) codes

    • Theoretical Computer Science
    • Computer Science(all)

    Fingerprint Dive into the research topics of 'A natural generalization of bounded tree-width and bounded clique-width'. Together they form a unique fingerprint.

    Cite this