Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances (Q3525616): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W4237942241 / rank | |||
Normal rank | |||
Latest revision as of 21:14, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding Paths Between Graph Colourings: PSPACE-Completeness and Superpolynomial Distances |
scientific article |
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
