On the parameterized complexity of contraction to generalization of trees (Q5111860)
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 contraction to generalization of trees |
scientific article; zbMATH DE number 7205185
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the parameterized complexity of contraction to generalization of trees |
scientific article; zbMATH DE number 7205185 |
Statements
27 May 2020
0 references
graph contraction
0 references
fixed-parameter tractability
0 references
graph algorithms
0 references
generalization of trees
0 references
On the Parameterized Complexity of Contraction to Generalization of Trees. (English)
0 references
0.9980663657188416
0 references
0.8496112823486328
0 references
0.8315305709838867
0 references
