Pages that link to "Item:Q1217715"

The following pages link to The communication problem on graphs (Q1217715):

Displaying 18 items.

• Epistemic protocols for dynamic gossip (Q504511) (← links)
• Toward optimal gossiping schemes with conference calls (Q787168) (← links)
• A class of solutions to the gossip problem. III (Q791539) (← links)
• Label-connected graphs and the gossip problem (Q804593) (← links)
• The number of rounds needed to exchange information within a graph (Q1054746) (← links)
• Quick gossiping without duplicate transmissions (Q1080864) (← links)
• A class of solutions to the gossip problem. I (Q1170198) (← links)
• Set to set broadcasting in communication networks (Q1208457) (← links)
• Gossips and telegraphs (Q1258315) (← links)
• Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
• The epistemic gossip problem (Q1712508) (← links)
• Kernels of minimum size gossip schemes (Q1897431) (← links)
• The partial gossiping problem (Q1910536) (← links)
• Reordered gossip schemes (Q1923510) (← links)
• Propositional gossip protocols (Q2140515) (← links)
• Dynamic gossip (Q2415893) (← links)
• Telephone Problems with Failures (Q3699732) (← links)
• A Problem with Telephones (Q3964600) (← links)