Near-perfect Token Distribution

Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-perfect token distribution problem redistributes the tokens in a minimum number of steps, so that, at the end, no more than O(1) tokens reside at each node. (In perfect distribution, at the end, exactly one token resides at each node.)

[1]  Alan M. Frieze,et al.  Near-perfect Token Distribution , 1994, Random Struct. Algorithms.

[2]  Béla Bollobás,et al.  Random Graphs , 1985 .

[3]  Eli Upfal,et al.  The Generalized Packet Routing Problem , 1987, Theor. Comput. Sci..

[4]  Nicholas Pippenger,et al.  On networks of noisy gates , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[5]  Noga Alon,et al.  Explicit construction of linear sized tolerant networks , 1988, Discret. Math..

[6]  Noga Alon,et al.  Eigenvalues and expanders , 1986, Comb..

[7]  Eli Upfal,et al.  Fault Tolerance in Networks of Bounded Degree , 1988, SIAM J. Comput..

[8]  Eli Upfal,et al.  The token distribution problem , 1989, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[9]  Edward A. Bender,et al.  The Asymptotic Number of Labeled Graphs with Given Degree Sequences , 1978, J. Comb. Theory A.