A Problem with Telephones

DOI10.1137/0602002zbMath0499.05034MaRDI QIDQ3964600

Richard T. Bumby

Publication date: 1981

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0602002

zbMATH Keywords

4-cycle; gossip problem

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

05C38: Paths and cycles

05C40: Connectivity

Related Items

Connectivity and inference problems for temporal networks, Toward optimal gossiping schemes with conference calls, A class of solutions to the gossip problem. III, Label-connected graphs and the gossip problem, Gossiping old ladies, The number of rounds needed to exchange information within a graph, Quick gossiping without duplicate transmissions, Further gossip problems, A class of solutions to the gossip problem. I, Set to set broadcasting in communication networks, Communication complexity of fault-tolerant information diffusion, Graph theoretical issues in computer networks, Better bounds for perpetual gossiping, Kernels of minimum size gossip schemes, The partial gossiping problem, Reordered gossip schemes, Information flows on hypergraphs, Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs, On Gossiping with Faulty Telephone Lines, Telephone Problems with Failures, Gossiping without Duplicate Transmissions

Cites Work

• Unnamed Item
• Further gossip problems
• The communication problem on graphs
• Gossips and telephones
• Monthly Research Problems, 1969-75
• A Cure for the Telephone Disease