Algorithmica

, Volume 23, Issue 3, pp 223–245

A Linear-Time Algorithm for the Feasibility of Pebble Motion on Trees

Authors

  • V. Auletta
    • Dipartimento di Informatica ed Applicazioni, ``R.M. Capocelli,'' Università di Salerno, 84081 Baronissi, Italy. auletta@dia.unisa.it, parente@dia.unisa.it, giuper@dia.unisa.it
  • A. Monti
    • Dipartimento di Scienze dell'Informazione, Università di Roma 1, ``La Sapienza,'' Roma, Italy. monti@dsi.uniroma1.it.
  • M. Parente
    • Dipartimento di Informatica ed Applicazioni, ``R.M. Capocelli,'' Università di Salerno, 84081 Baronissi, Italy. auletta@dia.unisa.it, parente@dia.unisa.it, giuper@dia.unisa.it
  • P. Persiano
    • Dipartimento di Informatica ed Applicazioni, ``R.M. Capocelli,'' Università di Salerno, 84081 Baronissi, Italy. auletta@dia.unisa.it, parente@dia.unisa.it, giuper@dia.unisa.it

DOI: 10.1007/PL00009259

Cite this article as:
Auletta, V., Monti, A., Parente, M. et al. Algorithmica (1999) 23: 223. doi:10.1007/PL00009259

Abstract.

We consider the following pebble motion problem. We are given a tree T with n vertices and two arrangements \(\cal R\) and \(\cal S\) of k<n distinct pebbles numbered 1, . . ., k on distinct vertices of the tree. Pebbles can move along edges of T provided that at any given time at most one pebble is traveling along an edge and each vertex of T contains at most one pebble. We are asked the following question:

Is arrangement \(\cal S\) reachable from \(\cal R\) ?

We present an algorithm that, on input two arrangements of k pebbles on a tree with n vertices, decides in time O(n) whether the two arrangements are reachable from one another. We also give an algorithm that, on input two reachable configurations, returns a sequence of moves that transforms one configuration into the other.

The pebble motion problem on trees has various applications including memory management in distributed systems, robot motion planning, and deflection routing.

Key words. Tree, Permutations, Feasibility, Pebble motion, Robot motion planning.

Copyright information

© 1999 Springer-Verlag New York Inc.