Better bounds for perpetual gossiping

DOI10.1016/S0166-218X(96)00088-1zbMath0882.90045OpenAlexW2162601412MaRDI QIDQ1363648

Alexander D. Scott

Publication date: 10 March 1998

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

perpetual gossiping

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Communication networks in operations research (90B18) Paths and cycles (05C38)

Cites Work

• A survey of gossiping and broadcasting in communication networks
• A Problem with Telephones
• Unnamed Item