Near-perfect Token Distribution

  title={Near-perfect Token Distribution},
  author={Andrei Z. Broder and Alan M. Frieze and Eli Shamir and Eli Upfal},
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 finite 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.) In this paper we present a simple algorithm that works for all extrovert graphs, a… CONTINUE READING

From This Paper

Topics from this paper.


Publications referenced by this paper.
Showing 1-7 of 7 references

Near-perfect token distribution

  • A. Z. Broder, A. M. Frieze, E. Shamir, E. Upfal
  • Proceedings of the 19th International Colloquium…
  • 1992
1 Excerpt

Random Graphs

  • B. Bollobás
  • Academic Press
  • 1985
3 Excerpts

Similar Papers

Loading similar papers…