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

From MaRDI portal
Revision as of 20:16, 2 July 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
Dynamic programming and planarity: improved tree-decomposition based algorithms
scientific article

    Statements

    title
    Dynamic programming and planarity: improved tree-decomposition based algorithms (English)
    0 references
    author
    Frederic Dorn
    0 references
    publication date
    25 May 2010
    0 references
    zbMATH Keywords
    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
    cites work
    Q2721971
    0 references
    Q3044360
    0 references
    Q4250161
    0 references
    Q4699283
    0 references
    Q4291429
    0 references
    Q5315023
    0 references
    Q3579494
    0 references
    Q4471291
    0 references
    Q4385515
    0 references

    Identifiers

    Mathematics Subject Classification ID
    90C39
    0 references
    05C10
    0 references
    05C70
    0 references
    05C05
    0 references
    zbMATH DE Number
    5711871
    0 references
    OpenAlex ID
    W1964495581
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q972340&oldid=35171453"
    Powered by MediaWiki