Pages that link to "Item:Q1773296"

The following pages link to Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance. (Q1773296):

Displaying 48 items.

• Binary linear programming models for robust broadcasting in communication networks (Q266832) (← links)
• All-to-all broadcast problem of some classes of graphs under the half duplex all-port model (Q400494) (← links)
• Gossiping and routing in second-kind Frobenius graphs (Q427787) (← links)
• Upper bounds on the broadcast function using minimum dominating sets (Q456886) (← links)
• Odd gossiping (Q516782) (← links)
• Efficient broadcast trees for weighted vertices (Q516786) (← links)
• Rumor spreading in social networks (Q541666) (← links)
• Messy broadcasting - decentralized broadcast schemes with limited knowledge (Q628314) (← links)
• Meeting the deadline: on the complexity of fault-tolerant continuous gossip (Q661066) (← links)
• Rooted level-disjoint partitions of Cartesian products (Q669354) (← links)
• A control-theoretic approach to disseminating values and overcoming malicious links in wireless networks (Q694835) (← links)
• Rotational circulant graphs (Q741752) (← links)
• Leader nodes in communities for information spreading (Q832130) (← links)
• On the runtime and robustness of randomized broadcasting (Q838155) (← links)
• Robust gossiping with an application to consensus (Q856404) (← links)
• On the complexity of the shortest-path broadcast problem (Q896659) (← links)
• On the complexity of bandwidth allocation in radio networks (Q952444) (← links)
• Broadcasting from multiple originators (Q967331) (← links)
• Gossiping by processors prone to omission failures (Q976104) (← links)
• Minimum broadcast tree decompositions (Q1025538) (← links)
• Spreading messages (Q1029342) (← links)
• Optimal gathering protocols on paths under interference constraints (Q1045041) (← links)
• Broadcasting multiple messages in the 1-in port model in optimal time (Q1631684) (← links)
• Optimal odd gossiping (Q1671312) (← links)
• Gossiping by energy-constrained mobile agents in tree networks (Q1998846) (← links)
• The shortest path problem in the Knödel graph (Q2018539) (← links)
• Propositional gossip protocols (Q2140515) (← links)
• Confidential gossip (Q2204776) (← links)
• The logic of gossiping (Q2211849) (← links)
• Modelling simultaneous broadcasting by level-disjoint partitions (Q2279226) (← links)
• Rumor spreading with bounded in-degree (Q2292916) (← links)
• Optimal gossiping in square 2D meshes (Q2382678) (← links)
• Minimum bisection is NP-hard on unit disk graphs (Q2407090) (← links)
• Dynamic gossip (Q2415893) (← links)
• On temporal graph exploration (Q2662667) (← links)
• Minimal number of calls in propositional protocols (Q2695494) (← links)
• Time-Optimal Broadcasting of Multiple Messages in 1-in Port Model (Q2958310) (← links)
• Nonadaptive broadcasting in trees (Q3082604) (← links)
• Theory and Practice of Discrete Interacting Agents Models (Q4686660) (← links)
• (Q4870160) (← links)
• (Q5016795) (← links)
• (Q5018499) (← links)
• A linear algorithm for finding the <i>k</i>‐broadcast center of a tree (Q5191149) (← links)
• On Mixing and Edge Expansion Properties in Randomized Broadcasting (Q5387757) (← links)
• Broadcasting in weighted trees under the postal model (Q5964023) (← links)
• Approximation algorithms in graphs with known broadcast time of the base graph (Q6102286) (← links)
• Source-oblivious broadcast (Q6636076) (← links)
• On broadcast schemes of Knödel graphs (Q6656780) (← links)