Improved Bounds for Minimum Fault-Tolerant Gossip Graphs

DOI10.1007/978-3-642-25870-1_19zbMath1341.05041OpenAlexW169840508MaRDI QIDQ3104777

Toru Hasunuma, Hiroshi Nagamochi

Publication date: 16 December 2011

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-25870-1_19

zbMATH Keywords

ordered graphascending path

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites Work

• Unnamed Item
• Verifiable broadcasting and gossiping in communication networks
• Gossips and telephones
• On Gossiping with Faulty Telephone Lines
• Quick Gossiping by Conference Calls
• Telephone Problems with Failures
• A survey of gossiping and broadcasting in communication networks
• Gossiping without Duplicate Transmissions
• A Problem with Telephones
• New bounds on the minimum number of calls in failure‐tolerant gossiping
• A Cure for the Telephone Disease
• Fault-tolerant broadcasting and gossiping in communication networks