Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (Q3448810): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W1190319202 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms to Preserve Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed Parameter Tractability of Binary Near-Perfect Phylogenetic Tree Reconstruction / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Tree Approximation via Iterative Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / 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: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saving space by algebraization / 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: Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Remark on Stirling's Formula / rank
 
Normal rank

Latest revision as of 22:47, 10 July 2024

scientific article
Language Label Description Also known as
English
Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree
scientific article

    Statements

    Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 October 2015
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references