The partial gossiping problem

DOI10.1016/0012-365X(94)00257-JzbMath0841.90063MaRDI QIDQ1910536

Yuh-Jiuan Tsay, Gerard Jennhwa Chang

Publication date: 24 March 1996

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

zbMATH Keywords

gossipingbroadcastingminimum number of calls

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Communication networks in operations research (90B18)

Related Items (2)

The exact gossiping problem ⋮ The epistemic gossip problem

Cites Work

• Unnamed Item
• Unnamed Item
• Further gossip problems
• New gossips and telephones
• The communication problem on graphs
• The complexity of comparability graph recognition and coloring
• Gossips and telephones
• The gossip problem
• Generalizations of broadcasting and gossiping
• A survey of gossiping and broadcasting in communication networks
• A Problem with Telephones
• A Cure for the Telephone Disease

This page was built for publication: The partial gossiping problem