An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem (Q2464330)

From MaRDI portal
Revision as of 22:53, 4 August 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem
scientific article

    Statements

    An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    19 December 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    FPT technique
    0 references
    exponential optimality
    0 references