FPT algorithms for connected feedback vertex set (Q695322): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Problems without Polynomial Kernels (Extended Abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Feedback Vertex Set New Measure and New Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing and Combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linearity of grid minors in treewidth with applications through bidimensionality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5315023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompressibility through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving connected dominating set faster than \(2^n\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensionality and Geometric Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Connected Feedback Vertex Set in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerate and expand: Improved algorithms for connected vertex cover and tree cover / 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

Revision as of 23:57, 5 July 2024

scientific article
Language Label Description Also known as
English
FPT algorithms for connected feedback vertex set
scientific article

    Statements

    FPT algorithms for connected feedback vertex set (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 December 2012
    0 references
    parameterized algorithms
    0 references
    FPT algorithms
    0 references
    connected feedback vertex set
    0 references
    feedback vertex set
    0 references
    group Steiner tree
    0 references
    Steiner tree
    0 references
    directed Steiner out-tree
    0 references
    hardness of polynomial kernelization
    0 references
    subexponential FPT algorithms
    0 references
    H-minor-free graphs
    0 references
    dynamic programming over tree decompositions
    0 references

    Identifiers