Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211)
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: Short cycles make W-hard problems hard: FPT algorithms for W-hard problems in graphs with no short cycles |
scientific article; zbMATH DE number 5377142
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles |
scientific article; zbMATH DE number 5377142 |
Statements
Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (English)
0 references
2 December 2008
0 references
dominating set
0 references
independent set
0 references
set cover
0 references
\(t\)-vertex cover
0 references
parameterized complexity
0 references
0 references
0.9140132665634156
0 references
0.8294641375541687
0 references
0.8137496113777161
0 references
0.8019657135009766
0 references
0.7841635346412659
0 references
