A Problem with Telephones

DOI10.1137/0602002MaRDI QIDQ3964600zbMATH OpenOpenAlexFDO

Authors 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-cyclegossip problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Connectivity (05C40)

Cites work

• A Cure for the Telephone Disease
• Further gossip problems
• Gossips and telephones
• scientific article; zbMATH DE number 3358479 (Why is no real title available?)
• Monthly Research Problems, 1969-75
• The communication problem on graphs

Cited in

(35)

• 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
• The epistemic gossip problem
• Kernels of minimum size gossip schemes
• The partial gossiping problem
• Reordered gossip schemes
• Propositional gossip protocols
• The logic of gossiping
• Lossy gossip and composition of metrics
• Information flows on hypergraphs
• Dynamic gossip
• Minimal number of calls in propositional protocols
• Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs
• On Gossiping with Faulty Telephone Lines
• Improved bounds for minimum fault-tolerant gossip graphs
• Telephone Problems with Failures
• Gossiping without Duplicate Transmissions
• scientific article; zbMATH DE number 7440211 (Why is no real title available?)
• Connectivity and inference problems for temporal networks
• Broadcasting in weighted trees under the postal model
• Sharp Thresholds in Random Simple Temporal Graphs
• Invited paper: Simple, strict, proper, happy: a study of reachability in temporal graphs
• The complexity of computing optimum labelings for temporal connectivity
• Temporal reachability dominating sets: contagion in temporal graphs
• Increasing paths in random temporal graphs
• 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: A Problem with Telephones

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