Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances (Q1034528)
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: Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances |
scientific article; zbMATH DE number 5626889
| 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 5626889 |
Statements
Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances (English)
0 references
6 November 2009
0 references
vertex-recolouring
0 references
colour graph
0 references
PSPACE-complete
0 references
superpolynomial distance
0 references
0.9949854016304016
0 references
0.912821650505066
0 references
0.8353508710861206
0 references
0.8318099975585938
0 references
0.8315422534942627
0 references
