Planar k-Path in Subexponential Time and Polynomial Space (Q3104782): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Graph separators: A parameterized view / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Highly connected sets and the excluded grid theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Catalan structures and dynamic programming in \(H\)-minor-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential parameterized algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / 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: Subexponential Algorithms for Partial Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensionality and Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Planar Hamiltonian Circuit Problem is NP-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth. Computations and approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Separator Theorem for Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / 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 Möbius Inversion: Improving on Steiner Tree and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized and Exact Computation / rank
 
Normal rank

Latest revision as of 17:40, 4 July 2024

scientific article
Language Label Description Also known as
English
Planar k-Path in Subexponential Time and Polynomial Space
scientific article

    Statements

    Planar k-Path in Subexponential Time and Polynomial Space (English)
    0 references
    0 references
    0 references
    0 references
    16 December 2011
    0 references
    \(H\)-minor-free graphs
    0 references

    Identifiers

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