Kernels of minimum size gossip schemes

DOI10.1016/0012-365X(94)00031-DzbMath0844.68092MaRDI QIDQ1897431

Roger Labahn

Publication date: 18 August 1996

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

zbMATH Keywords

gossip schemes

Mathematics Subject Classification ID

Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Combinatorics of partially ordered sets (06A07) Paths and cycles (05C38) Communication theory (94A05)

Related Items (2)

Reordered gossip schemes ⋮ Communication complexity of fault-tolerant information diffusion

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A recurrence for linear extensions
• A class of solutions to the gossip problem. III
• Label-connected graphs and the gossip problem
• Further gossip problems
• The communication problem on graphs
• Methods and problems of communication in usual networks
• Information flows on hypergraphs
• Projective images of modular (distributive, complemented) lattices are modular (distributive, complemented)
• Generalizations of broadcasting and gossiping
• A survey of gossiping and broadcasting in communication networks
• A Problem with Telephones
• Some minimum gossip graphs

This page was built for publication: Kernels of minimum size gossip schemes