scientific article; zbMATH DE number 15364

zbMATH Open0749.05061MaRDI QIDQ3972008FDOQ3972008

Ingo Warnke, Roger Labahn

Publication date: 25 June 1992

Title of this publication is not available (Why is that?)

zbMATH Keywords

generalized Fibonacci numbersgossiptelephone problem\(k\)-conference calls problem\(k\)-telegraph problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Social networks; opinion dynamics (91D30) Communication theory (94A05) Communication networks in operations research (90B18) Graph theory (05C99) General systems theory (93A99)

Cited In (14)

• Gossiping in Minimal Time
• Lower bounds on systolic gossip
• Note on optimal gossiping in some weak-connected graphs
• Gossiping and broadcasting versus computing functions in networks.
• Title not available (Why is that?)
• Gossiping and broadcasting versus computing functions in networks
• Quick Gossiping by Conference Calls
• Quick gossiping by telegraphs
• Methods and problems of communication in usual networks
• Gossiping in vertex-disjoint paths mode in interconnection networks
• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast Gossiping by Short Messages
• Gossiping with multiple sends and receives

   Recommendations

• Quick gossiping by telegraphs 👍 👎
• Quick gossiping without duplicate transmissions 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On Gossiping with Faulty Telephone Lines 👍 👎

This page was built for publication:

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