Broadcast and gossip in line-communication mode
From MaRDI portal
(Redirected from Publication:1382273)
Recommendations
Cites work
- A survey of gossiping and broadcasting in communication networks
- Graph theory with applications
- Line broadcasting in cycles
- Methods and problems of communication in usual networks
- Minimum-time line broadcast networks
- New gossips and telephones
- Optimal algorithms for broadcast and gossip in the edge-disjoint path modes
Cited in
(23)- Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs
- All-to-all broadcast problem of some classes of graphs under the half duplex all-port model
- Neighborhood Communications in Networks
- On linear-time data dissemination in dynamic rooted trees
- Fast Gossiping for the Hypercube
- The addition game: An abstraction of a communication problem
- Hierarchical broadcast and gossip networks
- Information spreading by mobile particles on a line
- Note on optimal gossiping in some weak-connected graphs
- Gossiping and broadcasting versus computing functions in networks.
- Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols
- Gossip Latin square and the meet-all gossipers problem
- Fast information sharing in a complete network
- Faster gossiping on butterfly networks
- Line-broadcasting in complete \(k\)-ary trees
- Convergence of periodic gossiping algorithms
- scientific article; zbMATH DE number 2146643 (Why is no real title available?)
- Minimum gossip bus networks
- Gossiping in chordal rings under the line model
- A survey of gossiping and broadcasting in communication networks
- Set to set broadcasting in communication networks
- Fast gossiping by short messages
- Odd gossiping
This page was built for publication: Broadcast and gossip in line-communication mode
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1382273)
