13 citations · 77 across the 56 of their papers we have counts for
Showing 2016Show all
2 papers · 1 filter
cs.CC2016
Complexity of Token Swapping and its Variants
Édouard Bonnet, Tillmann Miltzow, Paweł Rzążewski
In the Token Swapping problem we are given a graph with a token placed on each vertex. Each token has exactly one destination vertex, and we try to move all the tokens to their des…
cs.DM2016
Fixing improper colorings of graphs
Valentin Garnero, Konstanty Junosza-Szaniawski, Mathieu Liedloff +2
In this paper we consider a variation of a recoloring problem, called the Color-Fixing. Let us have some non-proper -coloring of a graph . We investigate the problem of f…