Parameterized complexity of the list coloring reconfiguration problem with graph parameters (Q1643161): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1016/j.tcs.2018.05.005 / rank | |||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129860106 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.TCS.2018.05.005 / rank | |||
Normal rank | |||
Latest revision as of 01:30, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Parameterized complexity of the list coloring reconfiguration problem with graph parameters |
scientific article |
Statements
Parameterized complexity of the list coloring reconfiguration problem with graph parameters (English)
0 references
18 June 2018
0 references
combinatorial reconfiguration
0 references
graph algorithm
0 references
list coloring
0 references
fixed-parameter algorithm
0 references
W[1]-hardness
0 references
0 references
0 references
