Two feedback problems for graphs with bounded tree-width (Q1764384)
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: Two feedback problems for graphs with bounded tree-width |
scientific article; zbMATH DE number 2138464
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Two feedback problems for graphs with bounded tree-width |
scientific article; zbMATH DE number 2138464 |
Statements
Two feedback problems for graphs with bounded tree-width (English)
0 references
24 February 2005
0 references
tree-width
0 references
tree-decomposition
0 references
feedback vertex set problem
0 references
vertex feedback edge set problem
0 references
dynamic programming
0 references
0.8054304718971252
0 references
0.8033767342567444
0 references
0.7966820597648621
0 references
0.7959097623825073
0 references
0.7893028855323792
0 references
