Greedy gossiping
Congressus Numerantium · 15.11.2026 · 238 · 113-121
DOI: 10.61091/cn238-05 ↗Kurz gefasst
Fachartikel in der Zeitschrift Congressus Numerantium, online erschienen am 15.11.2026. Verfasst von Kada K Williams.
Abstract (Originalsprache)
The renowned Gossiping Problem (1971) asks the following. There are \(n\) people who each know an item of gossip. In a telephone call, two people share all the gossip they know. How many calls are needed for all of them to be informed of all the gossip? If \(n\ge 4\), the answer is \(2n-4\). We initiate and solve the related Greedy Gossiping Problem: given a fixed number \(m
Zitieren
APA
Williams, K. K. (2026). Greedy gossiping. Congressus Numerantium, 238, 113-121. https://doi.org/10.61091/cn238-05
Vancouver
Williams KK. Greedy gossiping. Congressus Numerantium. 2026;238:113-121. doi:10.61091/cn238-05
BibTeX
@article{Williams2026,
author = {Williams, Kada K},
title = {Greedy gossiping},
journal = {Congressus Numerantium},
year = {2026},
volume = {238},
pages = {113--121},
doi = {10.61091/cn238-05}
}
EUVIMED