Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles |
scientific article |
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
