Finding Good Decompositions for Dynamic Programming on Dense Graphs (Q2891352)

From MaRDI portal
Revision as of 09:03, 5 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
Finding Good Decompositions for Dynamic Programming on Dense Graphs
scientific article

    Statements

    Finding Good Decompositions for Dynamic Programming on Dense Graphs (English)
    0 references
    0 references
    0 references
    0 references
    15 June 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references