Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340)

From MaRDI portal
Revision as of 01:57, 8 July 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 and planarity: improved tree-decomposition based algorithms
scientific article

    Statements

    Dynamic programming and planarity: improved tree-decomposition based algorithms (English)
    0 references
    0 references
    25 May 2010
    0 references
    tree-decompositions
    0 references
    dynamic programming
    0 references
    planar dominating set
    0 references
    planar Hamiltonian cycle
    0 references
    planar graph TSP
    0 references
    branch-decompositions
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references