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

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing optimal Steiner trees in polynomial space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming for minimum Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning spiders and light-splitting switches / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4142699 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on distributed multicast routing in point-to-point networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3679220 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Steiner Tree with Branching Constraint / rank
 
Normal rank

Latest revision as of 10:03, 9 July 2024

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