Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (Q1949736): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Counting Subgraphs via Homomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for exact satisfiability and number of perfect matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning via Inclusion-Exclusion / 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: The Travelling Salesman Problem in Bounded Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trimmed Moebius inversion and graphs of bounded degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the cover polynomial of a digraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and Parameterized Algorithms for Max Internal Spanning Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Steiner Tree Computation 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: A Moderately Exponential Time Algorithm for Full Degree Spanning Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming meets the principle of inclusion and exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning into Sets of Bounded Cardinality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saving space by algebraization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank

Latest revision as of 11:17, 6 July 2024

scientific article
Language Label Description Also known as
English
Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
scientific article

    Statements

    Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems (English)
    0 references
    0 references
    0 references
    16 May 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    inclusion-exclusion
    0 references
    fixed parameter tractability
    0 references
    exact algorithms
    0 references
    polynomial space
    0 references
    Steiner tree
    0 references
    0 references