Finding Shortest Paths between Graph Colourings

03/25/2014
by   Matthew Alastair Johnson, et al.
0

The k-colouring reconfiguration problem asks whether, for a given graph G, two proper k-colourings α and β of G, and a positive integer ℓ, there exists a sequence of at most ℓ+1 proper k-colourings of G which starts with α and ends with β and where successive colourings in the sequence differ on exactly one vertex of G. We give a complete picture of the parameterized complexity of the k-colouring reconfiguration problem for each fixed k when parameterized by ℓ. First we show that the k-colouring reconfiguration problem is polynomial-time solvable for k=3, settling an open problem of Cereceda, van den Heuvel and Johnson. Then, for all k ≥ 4, we show that the k-colouring reconfiguration problem, when parameterized by ℓ, is fixed-parameter tractable (addressing a question of Mouawad, Nishimura, Raman, Simjour and Suzuki) but that it has no polynomial kernel unless the polynomial hierarchy collapses.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/08/2020

Parameterized Complexity of (A,ℓ)-Path Packing

Given a graph G = (V,E), A ⊆ V, and integers k and ℓ, the (A,ℓ)-Path Pac...
research
07/15/2023

Minimum Separator Reconfiguration

We study the problem of reconfiguring one minimum s-t-separator A into a...
research
03/26/2018

Clustering to Given Connectivities

We define a general variant of the graph clustering problem where the cr...
research
01/09/2020

Improved Kernels for Tracking Path Problems

Given a graph G, terminal vertices s and t, and an integer k, the Tracki...
research
09/04/2019

Parameterized Intractability of Even Set and Shortest Vector Problem

The k-Even Set problem is a parameterized variant of the Minimum Distanc...
research
02/01/2021

Faulty picture-hanging improved

A picture-hanging puzzle is the task of hanging a framed picture with a ...
research
09/19/2019

Parameterized Complexity of Manipulating Sequential Allocation

The sequential allocation protocol is a simple and popular mechanism to ...

Please sign up or login with your details

Forgot password? Click here to reset