Abstract
Gossiping has been considered intensively for butterflies and regular butterflies (which have no wrap-around connections). In the telephone communication model, for a butterfly of order k, the best previous gossiping algorithms require 21/2 • k and 3 • k communication rounds, respectively. By new asymptotic methods we break through these bounds, proving new bounds of 21/4 • k + o(k) and 21/2 • k + o(k). © 2011 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Sibeyn, J. F. (2001). Faster gossiping on butterflies. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2076 LNCS, pp. 785–796). Springer Verlag. https://doi.org/10.1007/3-540-48224-5_64
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
