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

From MaRDI portal
Revision as of 19:44, 25 June 2024 by ReferenceBot (talk | contribs) (‎Changed an 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

    title
    MSOL partitioning problems on graphs of bounded treewidth and clique-width (English)
    0 references
    author
    Michaël Rao
    0 references
    publication date
    6 June 2007
    0 references
    zbMATH Keywords
    graph algorithms
    0 references
    monadic second-order logic
    0 references
    vertex partitioning
    0 references
    clique-width
    0 references
    treewidth
    0 references
    cites work
    Q4291429
    0 references
    Q4850061
    0 references
    Q4448752
    0 references
    Q5572332
    0 references
    Q4283244
    0 references
    Q5487903
    0 references

    Identifiers

    Mathematics Subject Classification ID
    68R10
    0 references
    03B15
    0 references
    03D05
    0 references
    05C85
    0 references
    68W05
    0 references
    zbMATH DE Number
    5161898
    0 references
    OpenAlex ID
    W2008361472
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q884481&oldid=34948573"
    Powered by MediaWiki