Generalizations of broadcasting and gossiping

DOI10.1002/net.3230180205zbMath0709.90540OpenAlexW2003701033MaRDI QIDQ3494462

Arthur L. Liestman, D. S. 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)

Related Items (18)

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

Cites Work

• Unnamed Item

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