Dynamic Programming for H-minor-free Graphs (Q2914314)

From MaRDI portal
Revision as of 09:24, 23 August 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
Dynamic Programming for H-minor-free Graphs
scientific article

    Statements

    Dynamic Programming for H-minor-free Graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 September 2012
    0 references
    analysis of algorithms
    0 references
    parameterized algorithms
    0 references
    graph minors
    0 references
    branchwidth
    0 references
    dynamic programming
    0 references
    non-crossing partitions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references