Gossiping in Cayley graphs by packets

DOI10.1007/3-540-61576-8_91MaRDI QIDQ6567690zbMATH OpenFDO

Authors Jean-Claude Bermond, T. Kodate, Stéphane Pérennes

Publication date 5 July 2024

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10) Network protocols (68M12)

Recommendations

• Fast gossiping by short messages
• Fast Gossiping by Short Messages
• Gossiping with multiple sends and receives
• Optimal gossiping in paths and cycles
• Odd gossiping

Cites work

• scientific article; zbMATH DE number 51132 (Why is no real title available?)
• A survey of gossiping and broadcasting in communication networks
• Fast gossiping by short messages
• Methods and problems of communication in usual networks
• Note on the problem of gossiping in multidimensional grids
• Parallel Information Dissemination by Packets

This page was built for publication: Gossiping in Cayley graphs by packets

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