Multi-Color Pebble Motion on Graphs

We consider a graph with n vertices, and p < n pebbles of m colors. A pebble move consists of transferring a pebble from its current host vertex to an adjacent unoccupied vertex. The problem is to move the pebbles to a given new color arrangement. We study the feasibility version of the problem - does a given instance have a solution? We use an algorithm of [6] for the problem where each pebble has a distinct color to give a linear time algorithm for the feasibility decision problem on a general graph.

• Type: Journal
• Year: 2010
• Where: ALGORITHMICA
• Authors: Gilad Goraly, Refael Hassin
• Keywords: Adjacent Unoccupied Vertex, ALGORITHMICA 2007, ALGORITHMICA 2010, Current Host Vertex, Pebble