An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem (Q2464330): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 01:38, 3 February 2024
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
19 December 2007
0 references
FPT technique
0 references
exponential optimality
0 references