On the Parameterized Complexity of Maximum Degree Contraction Problem. (Q6089673)
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: On the Parameterized Complexity of Maximum Degree Contraction Problem. |
scientific article; zbMATH DE number 7764117
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Parameterized Complexity of Maximum Degree Contraction Problem. |
scientific article; zbMATH DE number 7764117 |
Statements
13 November 2023
0 references
graph contraction problems
0 references
FPT algorithm
0 references
lower bound
0 references
ETH
0 references
no polynomial kernel
0 references
On the Parameterized Complexity of Maximum Degree Contraction Problem. (English)
0 references
0 references
0 references
