Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters (Q5111266)
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 the List Coloring Reconfiguration Problem with Graph Parameters |
scientific article; zbMATH DE number 7204385
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters |
scientific article; zbMATH DE number 7204385 |
Statements
26 May 2020
0 references
combinatorial reconfiguration
0 references
fixed-parameter tractability
0 references
graph algorithm
0 references
list coloring
0 references
W[1]-hardness
0 references
0 references
Parameterized Complexity of the List Coloring Reconfiguration Problem with Graph Parameters (English)
0 references
0.9997291564941406
0 references
0.8557718396186829
0 references
0.830292820930481
0 references
0.8292189240455627
0 references
0.8205121159553528
0 references
