Complexity of coloring reconfiguration under recolorability constraints (Q5136283)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7278067
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of coloring reconfiguration under recolorability constraints |
scientific article; zbMATH DE number 7278067 |
Statements
25 November 2020
0 references
combinatorial reconfiguration
0 references
graph coloring
0 references
PSPACE-completeness
0 references
0 references
Complexity of Coloring Reconfiguration under Recolorability Constraints (English)
0 references
0.8575457334518433
0 references
0.8565665483474731
0 references
0.8248042464256287
0 references
0.8193293809890747
0 references
0.8178786039352417
0 references
