Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances (Q3525616)
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 5344703
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances |
scientific article; zbMATH DE number 5344703 |
Statements
Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances (English)
0 references
17 September 2008
0 references
vertex-recolouring
0 references
colour graph
0 references
PSPACE-complete
0 references
superpolynomial distance
0 references
0.9949854016304016
0 references
0.9289969801902772
0 references
0.8488427400588989
0 references
0.84563809633255
0 references
0.8342703580856323
0 references
