Periodic gossiping on trees

DOI10.1016/0166-218X(94)90187-2MaRDI QIDQ1339893zbMATH OpenOpenAlexWikidataFDO

Authors Roger Labahn, Stephen T. Hedetniemi, Renu C. Laskar

Publication date 11 April 1996

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0166-218x(94)90187-2

zbMATH Keywords

periodic gossip schemes

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Recommendations

• Periodic gossiping in back-to-back trees
• Broadcast and gossip in line-communication mode
• Time and Cost Trade-Offs in Gossiping
• Convergence of periodic gossiping algorithms
• Better bounds for perpetual gossiping

Cited in

(6)

• Periodic gossiping in back-to-back trees
• Lower bounds on systolic gossip
• The complexity of systolic dissemination of information in interconnection networks
• Convergence of periodic gossiping algorithms
• Effective systolic algorithms for gossiping in cycles and two-dimensional grids
• Periodic gossiping in commuted networks

This page was built for publication: Periodic gossiping on trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1339893)