Generalizations of broadcasting and gossiping

DOI10.1002/NET.3230180205MaRDI QIDQ3494462zbMATH OpenOpenAlexFDO

Authors Arthur L. Liestman, Dana Richards

Publication date 1988

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230180205

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cited in

(18)

• An approximation algorithm and dynamic programming for reduction in heterogeneous environments
• Set to set broadcasting in communication networks
• Optimal algorithms for dissemination of information in some interconnection networks
• Methods and problems of communication in usual networks
• Note on optimal gossiping in some weak-connected graphs
• The exact gossiping problem
• Gossiping and broadcasting versus computing functions in networks.
• Kernels of minimum size gossip schemes
• The partial gossiping problem
• The broadcast median problem in heterogeneous postal model
• Information flows on hypergraphs
• Binary linear programming models for robust broadcasting in communication networks
• An algorithm for constructing minimal c-broadcast networks
• Broadcast transmission to prioritizing receivers
• Gossiping and broadcasting versus computing functions in networks
• Concurrent multicast in weighted networks
• Concurrent multicast in weighted networks
• Broadcasting on networks of workstations

This page was built for publication: Generalizations of broadcasting and gossiping

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