A class of solutions to the gossip problem. I

DOI10.1016/0012-365X(82)90153-4zbMath0497.05037WikidataQ106159493 ScholiaQ106159493MaRDI QIDQ1170198

Douglas B. West

Publication date: 1982

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

zbMATH Keywords

perfect matchingcaterpillarsgossip problemNOHO graphsplanar bigraphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph theory (05C99) Communication theory (94A05)

Related Items

Gossiping without Duplicate Transmissions ⋮ Quick gossiping without duplicate transmissions ⋮ Asymptotically optimal gossiping in radio networks ⋮ Everyone knows that everyone knows ⋮ A class of solutions to the gossip problem. II ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ On Gossiping with Faulty Telephone Lines ⋮ An approximation algorithm and dynamic programming for reduction in heterogeneous environments ⋮ A class of solutions to the gossip problem. III

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Further gossip problems
• New gossips and telephones
• The communication problem on graphs
• Spreading information by conferences
• Gossips and telegraphs
• Gossips and telephones
• Information Dissemination in Trees
• A Problem with Telephones
• Efficient Communication by Phone Calls
• A Cure for the Telephone Disease