Detecting Feedback Vertex Sets of Size <i>k</i> in <i>O</i> <sup>⋆</sup> (2.7 <i>k</i> ) Time (Q6058262)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Detecting Feedback Vertex Sets of Size k in O ⋆ (2.7 k ) Time |
scientific article; zbMATH DE number 7758428
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Detecting Feedback Vertex Sets of Size <i>k</i> in <i>O</i> <sup>⋆</sup> (2.7 <i>k</i> ) Time |
scientific article; zbMATH DE number 7758428 |
Statements
Detecting Feedback Vertex Sets of Size <i>k</i> in <i>O</i> <sup>⋆</sup> (2.7 <i>k</i> ) Time (English)
0 references
31 October 2023
0 references
feedback vertex set
0 references
parameterized complexity
0 references
treewidth
0 references
0.9925748109817504
0 references
0.8854832649230957
0 references
0.8824447393417358
0 references
0.8766140341758728
0 references
0.8751811981201172
0 references
