The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (Q4012672)

From MaRDI portal
Revision as of 13:22, 16 May 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
The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues
scientific article

    Statements

    title
    The monadic second-order logic of graphs III : tree-decompositions, minors and complexity issues (English)
    0 references
    publication date
    27 September 1992
    0 references
    zbMATH Keywords
    graphs
    0 references
    hypergraphs
    0 references
    formal language
    0 references
    tree-decompositions
    0 references
    monadic second-order logic
    0 references
    minors
    0 references
    quadratic algorithms
    0 references
    author
    Bruno Courcelle
    0 references
    cites work
    Q4037299
    0 references
    Q3796771
    0 references
    Q3795218
    0 references
    Q4694755
    0 references
    Q4385531
    0 references
    Q3785988
    0 references
    Q3795250
    0 references
    Q3220637
    0 references
    Q4097268
    0 references
    Q4385515
    0 references
    Q4037335
    0 references
    Q4036591
    0 references

    Identifiers

    Mathematics Subject Classification ID
    03B15
    0 references
    68Q45
    0 references
    68Q42
    0 references
    03B25
    0 references
    68R10
    0 references
    05C05
    0 references
    05C65
    0 references
    zbMATH DE Number
    65135
    0 references
    OpenAlex ID
    W182050876
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q4012672&oldid=34092439"
    Powered by MediaWiki