Abstract
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.)
In this paper we present a simple algorithm that works for all extrovert graphs, a new property which we define and study. In terms of connectivity requirements, extrovert graphs are in-between expanders and compressors. Our results lead to an optimal solution for the near-perfect token distribution problem on almost all cubic graphs. The new solution is conceptually simpler than previous algorithms, and applies to graphs of minimum possible degree.
A portion of this work was done while the author was visiting DEC SRC. Supported in part by NSF Grant CCR 0089112.
A portion of this work was done while the author was visiting DEC SRC.
Preview
Unable to display preview. Download preview PDF.
References
Bender, E. A. and Canfield, E. R.: The asymptotic number of labeled graphs with given degree sequences. Journal of Combinatorial Theory B, 24 (1978) 296–307
Bollobás, B.: Random graphs, Academic Press, (1985)
Pippenger, N.: On networks of noisy gates. 26th Annual Symposium on Foundations of Computer Science (1985) 30–38
Peleg, D. and Upfal, E.: The token redistribution problem. SIAM Journal of Computing, 18 (1989) 229–243
Peleg, D. and Upfal, E.: The Generalized Packet Routing Problem. Theoretical Computer Science, 53 (1987) 281–293
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Broder, A.Z., Frieze, A.M., Shamir, E., Upfal, E. (1992). Near-perfect token distribution. In: Kuich, W. (eds) Automata, Languages and Programming. ICALP 1992. Lecture Notes in Computer Science, vol 623. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55719-9_83
Download citation
DOI: https://doi.org/10.1007/3-540-55719-9_83
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55719-7
Online ISBN: 978-3-540-47278-0
eBook Packages: Springer Book Archive