On the parameterized complexity of contraction to generalization of trees (Q2000005)
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 7074496
| 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 7074496 |
Statements
On the parameterized complexity of contraction to generalization of trees (English)
0 references
27 June 2019
0 references
graph contraction
0 references
fixed-parameter tractability
0 references
graph algorithms
0 references
generalization of trees
0 references
0.9980663657188416
0 references
0.8553169965744019
0 references
0.8514589071273804
0 references
0.8502969741821289
0 references
0.8383572101593018
0 references
