Greedy gossiping

DOI10.61091/CN238-05MaRDI QIDQ7363848zbMATH OpenFDO

Authors Kada K. Williams

Publication date 30 September 2026

Published in Congressus Numerantium (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.61091/CN238-05

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Cites work

• A Cure for the Telephone Disease
• A survey of gossiping and broadcasting in communication networks
• Better bounds for perpetual gossiping
• Further gossip problems
• Gossips and telephones
• scientific article; zbMATH DE number 5066400 (Why is no real title available?)
• scientific article; zbMATH DE number 3358479 (Why is no real title available?)
• On temporal graph exploration
• Partial Shuffles by Lazy Swaps
• Temporal cliques admit sparse spanners
• The partial gossiping problem

This page was built for publication: Greedy gossiping

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