Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles (Q958211): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-007-9148-9 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-007-9148-9 / rank | |||
Normal rank | |||
Latest revision as of 09:59, 10 December 2024
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
