On optimal solutions to the problem of gossiping in minimum time
From MaRDI portal
Publication:2747181
zbMATH Open0985.94022MaRDI QIDQ2747181
Publication date: 19 November 2001
Published in: JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Information theory (general) (94A15) Applications of graph theory to circuits and networks (94C15)
Related Items (5)
Optimal gossip with direct addressing ⋮ Spreading alerts quietly and the subgroup escape problem ⋮ Order optimal information spreading using algebraic gossip ⋮ Spreading Alerts Quietly and the Subgroup Escape Problem ⋮ Optimal gossiping in paths and cycles
This page was built for publication: On optimal solutions to the problem of gossiping in minimum time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2747181)
