Parameterized complexity of finding small degree-constrained subgraphs (Q414424)
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: Parameterized complexity of finding small degree-constrained subgraphs |
scientific article; zbMATH DE number 6033167
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity of finding small degree-constrained subgraphs |
scientific article; zbMATH DE number 6033167 |
Statements
Parameterized complexity of finding small degree-constrained subgraphs (English)
0 references
11 May 2012
0 references
parameterized complexity
0 references
degree-constrained subgraph
0 references
fixed-parameter tractable algorithm
0 references
\(W[1]\)-hardness
0 references
treewidth
0 references
dynamic programming
0 references
excluded minors
0 references
0 references
