The complexity of bounded length graph recoloring and CSP reconfiguration (Q2946012)
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 6482351
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of bounded length graph recoloring and CSP reconfiguration |
scientific article; zbMATH DE number 6482351 |
Statements
The Complexity of Bounded Length Graph Recoloring and CSP Reconfiguration (English)
0 references
15 September 2015
0 references
0.8565665483474731
0 references
0.829438328742981
0 references
0.8288376331329346
0 references
0.819547176361084
0 references
