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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-011-9394-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2007985221 / rank
 
Normal rank

Revision as of 00:04, 20 March 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