MSOL partitioning problems on graphs of bounded treewidth and clique-width (Q884481)

From MaRDI portal
Revision as of 17:39, 6 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
MSOL partitioning problems on graphs of bounded treewidth and clique-width
scientific article

    Statements

    MSOL partitioning problems on graphs of bounded treewidth and clique-width (English)
    0 references
    0 references
    6 June 2007
    0 references
    graph algorithms
    0 references
    monadic second-order logic
    0 references
    vertex partitioning
    0 references
    clique-width
    0 references
    treewidth
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references