Pages that link to "Item:Q3795460"
From MaRDI portal
The following pages link to A survey of gossiping and broadcasting in communication networks (Q3795460):
Displaying 50 items.
- Binary linear programming models for robust broadcasting in communication networks (Q266832) (← links)
- Hierarchical broadcast networks (Q293474) (← links)
- A tight upper bound on acquaintance time of graphs (Q343701) (← links)
- A note on the acquaintance time of random graphs (Q396895) (← links)
- All-to-all broadcast problem of some classes of graphs under the half duplex all-port model (Q400494) (← links)
- A PTAS for geometric 2-FTP (Q402355) (← links)
- Knowledge-based multi-criteria optimization to support indoor positioning (Q421460) (← links)
- Gossiping and routing in second-kind Frobenius graphs (Q427787) (← links)
- Optimal broadcast for fully connected processor-node networks (Q436809) (← links)
- Upper bounds on the broadcast function using minimum dominating sets (Q456886) (← links)
- The worst case behavior of randomized gossip protocols (Q477180) (← links)
- Epistemic protocols for dynamic gossip (Q504511) (← links)
- Odd gossiping (Q516782) (← links)
- Efficient broadcast trees for weighted vertices (Q516786) (← links)
- Minimum multiple originator broadcast graphs (Q516794) (← links)
- Messy broadcasting - decentralized broadcast schemes with limited knowledge (Q628314) (← links)
- Spreading of messages in random graphs (Q633767) (← links)
- Parsimonious flooding in dynamic graphs (Q661047) (← links)
- Rooted level-disjoint partitions of Cartesian products (Q669354) (← links)
- The minimum broadcast time problem for several processor networks (Q672455) (← links)
- Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2 (Q685502) (← links)
- On maximal instances for the original syntenic distance (Q703532) (← links)
- Optimal scheduling of peer-to-peer file dissemination (Q835584) (← links)
- On the number of broadcast schemes in networks (Q845865) (← links)
- The structure of information networks (Q852336) (← links)
- Robust gossiping with an application to consensus (Q856404) (← links)
- An online distributed gossiping protocol for mobile networks (Q857763) (← links)
- A generalized broadcasting schema for the mesh structures (Q884585) (← links)
- On the complexity of the shortest-path broadcast problem (Q896659) (← links)
- All-to-all broadcast problems on Cartesian product graphs (Q897889) (← links)
- Parallel algorithms for gossiping by mail (Q911271) (← links)
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem (Q932651) (← links)
- Broadcasting from multiple originators (Q967331) (← links)
- Broadcasting on networks of workstations (Q973010) (← links)
- Cooperative TSP (Q982655) (← links)
- Rapid almost-complete broadcasting in faulty networks (Q1008737) (← links)
- An approximation algorithm and dynamic programming for reduction in heterogeneous environments (Q1024788) (← links)
- Spreading messages (Q1029342) (← links)
- On broadcasting in unicyclic graphs (Q1029711) (← links)
- The generalized hierarchical product of graphs (Q1043554) (← links)
- Cayley graphs as classifiers for data mining: the influence of asymmetries (Q1044901) (← links)
- Broadcasting in complete networks with faulty nodes using unreliable calls (Q1183465) (← links)
- Sparse broadcast graphs (Q1192945) (← links)
- Optimal total exchange for a 3-D torus of processors (Q1198033) (← links)
- Broadcasting in DMA-bound bounded degree graphs (Q1199443) (← links)
- Minimum broadcast digraphs (Q1199444) (← links)
- Set to set broadcasting in communication networks (Q1208457) (← links)
- Fast information sharing in a complete network (Q1209151) (← links)
- Optimal algorithms for dissemination of information in some interconnection networks (Q1261287) (← links)
- Perfect broadcasting in unlabeled networks (Q1270770) (← links)
