An algorithmic metatheorem for directed treewidth (Q266806)

From MaRDI portal
Revision as of 12:55, 18 April 2024 by Importer (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An algorithmic metatheorem for directed treewidth
scientific article

    Statements

    title
    An algorithmic metatheorem for directed treewidth (English)
    0 references
    publication date
    7 April 2016
    0 references
    Mathematics Subject Classification ID
    05C20
    0 references
    05C12
    0 references
    05C05
    0 references
    03B15
    0 references
    zbMATH DE Number
    6566286
    0 references
    zbMATH Keywords
    combinatorial slice theory
    0 references
    directed treewidth
    0 references
    tree-zig-zag number
    0 references
    monadic second order logic of graphs
    0 references
    algorithmic metatheorems
    0 references
    OpenAlex ID
    W2963004311
    0 references
    arXiv ID
    1410.0589
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q266806&oldid=33290393"
    Powered by MediaWiki