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

From MaRDI portal
Revision as of 14:20, 22 March 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q57359936, #quickstatements; #temporary_batch_1711094041063)
(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
    FPT technique
    0 references
    exponential optimality
    0 references

    Identifiers

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