The partial gossiping problem

DOI10.1016/0012-365X(94)00257-JMaRDI QIDQ1910536zbMATH OpenFDO

Authors Yuh-Jiuan Tsay, Gerard Jennhwa Chang

Publication date 24 March 1996

Published in Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

broadcastinggossipingminimum number of calls

Mathematics Subject Classification ID

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

Recommendations

• The exact gossiping problem
• scientific article; zbMATH DE number 2061800
• On optimal solutions to the problem of gossiping in minimum time
• A class of solutions to the gossip problem. III
• scientific article; zbMATH DE number 2114510
• On generalized gossiping and broadcasting
• Optimal odd gossiping
• On the complexity of asynchronous gossip
• The worst case behavior of randomized gossip
• Optimal gossiping in paths and cycles

Cites work

• scientific article; zbMATH DE number 3559612 (Why is no real title available?)
• scientific article; zbMATH DE number 3358479 (Why is no real title available?)
• A Cure for the Telephone Disease
• A Problem with Telephones
• A survey of gossiping and broadcasting in communication networks
• Further gossip problems
• Generalizations of broadcasting and gossiping
• Gossips and telephones
• New gossips and telephones
• The communication problem on graphs
• The complexity of comparability graph recognition and coloring
• The gossip problem

Cited in

(7)

• The epistemic gossip problem
• On optimal solutions to the problem of gossiping in minimum time
• Reachability and expectation in gossiping
• Spreading Alerts Quietly and the Subgroup Escape Problem
• Spreading alerts quietly and the subgroup escape problem
• Note on the problem of gossiping in multidimensional grids
• The exact gossiping problem

This page was built for publication: The partial gossiping problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1910536)