Coordinating Pebble Motion on Graphs, The Diameter of Permutation Groups, and Applications
Name
MIT-LCS-TR-320.pdf
Size
3.53 MB
Format
Adobe PDF
Checksum (MD5)
012734a1adf6a60ef3dfd66ce6314f59
Author(s)
Kornhauser, Daniel Martin
Advisor(s)
Miller, Gary L.
Date Issued
May 1984
Series/Report no.
MIT-LCS-TR-320
Abstract
The problem of memory management in totally distributed computing systems leads to the following movers' problem on graphics: Let G be a graph with n vertices with k < n pebbles number 1...,k on distinct vertices. A move consists of transferring a pebble to an adjacent unoccupied vertex. The problem is to decide whether one arrangement of the pebbles is reachable from another, and to find the shortest sequence of moves to find the rearrangement when it is possible.
Persistent DSpace Link
