An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (Q477657)

From MaRDI portal
Revision as of 10:03, 9 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
An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes
scientific article

    Statements

    An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 December 2014
    0 references
    directed Steiner tree
    0 references
    parameterized complexity
    0 references
    dynamic programming
    0 references
    algorithms
    0 references
    combinatorial problems
    0 references

    Identifiers