Swapping Colored Tokens on Graphs

03/19/2018
by   Katsuhisa Yamanaka, et al.
0

We investigate the computational complexity of the following problem. We are given a graph in which each vertex has an initial and a target color. Each pair of adjacent vertices can swap their current colors. Our goal is to perform the minimum number of swaps so that the current and target colors agree at each vertex. When the colors are chosen from 1,2,...,c, we call this problem c-Colored Token Swapping since the current color of a vertex can be seen as a colored token placed on the vertex. We show that c-Colored Token Swapping is NP-complete for c = 3 even if input graphs are restricted to connected planar bipartite graphs of maximum degree 3. We then show that 2-Colored Token Swapping can be solved in polynomial time for general graphs and in linear time for trees. Besides, we show that, the problem for complete graphs is fixed-parameter tractable when parameterized by the number of colors, while it is known to be NP-complete when the number of colors is unbounded.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/09/2018

A Complexity Dichotomy for Critical Values of the b-Chromatic Number of Graphs

A b-coloring of a graph G is a proper coloring of its vertices such that...
research
06/25/2018

Finding Optimal Solutions to Token Swapping by Conflict-based Search and Reduction to SAT

We study practical approaches to solving the token swapping (TSWAP) prob...
research
06/14/2022

The Complexity of Finding Fair Many-to-One Matchings

We analyze the (parameterized) computational complexity of "fair" varian...
research
03/16/2019

Token Swapping on Trees

The input to the token swapping problem is a graph with vertices v_1, v_...
research
01/31/2023

Zero-Memory Graph Exploration with Unknown Inports

We study a very restrictive graph exploration problem. In our model, an ...
research
03/12/2021

Bears with Hats and Independence Polynomials

Consider the following hat guessing game. A bear sits on each vertex of ...
research
09/23/2020

Cyclic Shift Problems on Graphs

We study a new reconfiguration problem inspired by classic mechanical pu...

Please sign up or login with your details

Forgot password? Click here to reset