Graph minors. II. Algorithmic aspects of tree-width (Q3751592)

From MaRDI portal
Revision as of 01:37, 20 March 2024 by Openalex240319060354 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Graph minors. II. Algorithmic aspects of tree-width
scientific article

    Statements

    Graph minors. II. Algorithmic aspects of tree-width (English)
    0 references
    0 references
    0 references
    1986
    0 references
    contractability
    0 references
    tree-width
    0 references
    polynomially bounded algorithm
    0 references
    planar graph
    0 references
    polynomial algorithm
    0 references

    Identifiers

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