The communication problem on graphs

DOI10.1016/0016-0032(74)90126-4MaRDI QIDQ1217715zbMATH OpenOpenAlexFDO

Authors Frank Harary, Allen J. Schwenk

Publication date 1974

Published in Journal of the Franklin Institute (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0016-0032(74)90126-4

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Enumeration in graph theory (05C30)

Cites work

• A Cure for the Telephone Disease
• Gossips and telephones
• scientific article; zbMATH DE number 3358479 (Why is no real title available?)
• scientific article; zbMATH DE number 3390098 (Why is no real title available?)
• Parallel concepts in graph theory

Cited in

(19)

• The number of rounds needed to exchange information within a graph
• Quick gossiping without duplicate transmissions
• A class of solutions to the gossip problem. I
• Set to set broadcasting in communication networks
• Gossips and telegraphs
• Communication complexity of fault-tolerant information diffusion
• The epistemic gossip problem
• Kernels of minimum size gossip schemes
• The partial gossiping problem
• Reordered gossip schemes
• Propositional gossip protocols
• Dynamic gossip
• Telephone Problems with Failures
• A Problem with Telephones
• Epistemic protocols for dynamic gossip
• Gossiping in vertex-disjoint paths mode in interconnection networks
• Toward optimal gossiping schemes with conference calls
• A class of solutions to the gossip problem. III
• Label-connected graphs and the gossip problem

This page was built for publication: The communication problem on graphs

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