A class of solutions to the gossip problem. III

DOI10.1016/0012-365X(82)90128-5zbMath0536.05042MaRDI QIDQ791539

Douglas B. West

Publication date: 1982

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

zbMATH Keywords

gossipingperfect matchingcaterpillarsNOHO-graphs

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Paths and cycles (05C38) Graph theory (05C99)

Related Items (5)

Gossiping without Duplicate Transmissions ⋮ Quick gossiping without duplicate transmissions ⋮ Information flows on hypergraphs ⋮ Kernels of minimum size gossip schemes ⋮ On linear-time data dissemination in dynamic rooted trees

Cites Work

• A class of solutions to the gossip problem. I
• A class of solutions to the gossip problem. II
• The communication problem on graphs
• Gossiping without Duplicate Transmissions
• A Problem with Telephones

This page was built for publication: A class of solutions to the gossip problem. III