Quick gossiping by telegraphs

DOI10.1016/0012-365X(94)90290-9zbMath0790.05088MaRDI QIDQ1318840

Roger Labahn, Ingo Warnke

Publication date: 4 April 1994

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

zbMATH Keywords

informationgossipingcomplete doubly directed graphtelegrams

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Paths and cycles (05C38) Graph theory (05C99) Applications of graph theory to circuits and networks (94C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Methods and problems of communication in usual networks ⋮ Oriented hypercubes ⋮ Faster gossiping on butterfly networks

Cites Work

• Unnamed Item
• Fast information sharing in a complete network
• Gossips and telegraphs
• Information flows on hypergraphs
• A survey of gossiping and broadcasting in communication networks
• Gossiping in Minimal Time

This page was built for publication: Quick gossiping by telegraphs