Pages that link to "Item:Q3494462"
From MaRDI portal
The following pages link to Generalizations of broadcasting and gossiping (Q3494462):
Displaying 18 items.
- Binary linear programming models for robust broadcasting in communication networks (Q266832) (← links)
- Broadcasting on networks of workstations (Q973010) (← links)
- An approximation algorithm and dynamic programming for reduction in heterogeneous environments (Q1024788) (← links)
- Set to set broadcasting in communication networks (Q1208457) (← links)
- Optimal algorithms for dissemination of information in some interconnection networks (Q1261287) (← links)
- Methods and problems of communication in usual networks (Q1339884) (← links)
- Note on optimal gossiping in some weak-connected graphs (Q1342244) (← links)
- The exact gossiping problem (Q1356537) (← links)
- Gossiping and broadcasting versus computing functions in networks. (Q1427193) (← links)
- Kernels of minimum size gossip schemes (Q1897431) (← links)
- The partial gossiping problem (Q1910536) (← links)
- The broadcast median problem in heterogeneous postal model (Q1956241) (← links)
- Information flows on hypergraphs (Q2366011) (← links)
- An algorithm for constructing minimal \(c\)-broadcast networks (Q2747800) (← links)
- Broadcast Transmission to Prioritizing Receivers (Q4591231) (← links)
- Gossiping and broadcasting versus computing functions in networks (Q5047171) (← links)
- Concurrent multicast in weighted networks (Q5054855) (← links)
- Concurrent multicast in weighted networks (Q5941285) (← links)
