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 |
Created claim: Wikidata QID (P12): Q57359936, #quickstatements; #temporary_batch_1711094041063 |
||
(5 intermediate revisions by 4 users not shown) | |||
Property / author | |||
Property / author: Frances A. Rosamond / rank | |||
Property / author | |||
Property / author: Frances A. Rosamond / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s00224-007-1345-z / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1971393213 / rank | |||
Normal rank | |||
Property / Wikidata QID | |||
Property / Wikidata QID: Q57359936 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 14:20, 22 March 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