The following pages link to New gossips and telephones (Q1217126):
Displaying 50 items.
- 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)
- Parallel algorithms for gossiping by mail (Q911271) (← links)
- A class of solutions to the gossip problem. I (Q1170198) (← links)
- Set to set broadcasting in communication networks (Q1208457) (← links)
- Fast information sharing in a complete network (Q1209151) (← links)
- Spreading information by conferences (Q1225618) (← links)
- Gossips and telegraphs (Q1258315) (← links)
- Methods and problems of communication in usual networks (Q1339884) (← links)
- A minimum broadcast graph on 63 vertices (Q1339894) (← links)
- Note on optimal gossiping in some weak-connected graphs (Q1342244) (← links)
- The exact gossiping problem (Q1356537) (← links)
- Optimal algorithms for broadcast and gossip in the edge-disjoint modes (Q1357008) (← links)
- Broadcast and gossip in line-communication mode (Q1382273) (← links)
- The relationship between the gossip complexity in vertex-disjoint paths mode and the vertex bisection width (Q1392537) (← links)
- A survey on Knödel graphs. (Q1427198) (← links)
- On the structure of minimum broadcast digraphs (Q1575743) (← links)
- Hierarchical broadcast and gossip networks (Q1607034) (← links)
- Broadcasting multiple messages in the 1-in port model in optimal time (Q1631684) (← links)
- Optimal odd gossiping (Q1671312) (← links)
- Power domination in Knödel graphs and Hanoi graphs (Q1692626) (← links)
- The epistemic gossip problem (Q1712508) (← links)
- On linear-time data dissemination in dynamic rooted trees (Q1727754) (← links)
- Domination in 4-regular Knödel graphs (Q1738162) (← links)
- Optimal computation of census functions in the postal model (Q1804885) (← links)
- The partial gossiping problem (Q1910536) (← links)
- More broadcast graphs (Q1961235) (← links)
- The shortest path problem in the Knödel graph (Q2018539) (← links)
- Simple multi-party set reconciliation (Q2075624) (← links)
- A new construction of broadcast graphs (Q2181251) (← links)
- Dynamic gossip (Q2415893) (← links)
- Diametral broadcast graphs (Q2449105) (← links)
- Everyone knows that everyone knows (Q2658278) (← links)
- Minimum linear gossip graphs and maximal linear \((\Delta,k)\)-gossip graphs (Q2764998) (← links)
- A New Construction of Broadcast Graphs (Q2795946) (← links)
- On equitable colouring of Knödel graphs (Q2935368) (← links)
- Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs (Q2971647) (← links)
- On Gossiping with Faulty Telephone Lines (Q3029035) (← links)
- The Pleasure of Gossip (Q3299841) (← links)
- (Q4519135) (← links)
- Total domination in cubic Knodel graphs (Q4957563) (← links)
- Optimal algorithms for broadcast and gossip in the edge-disjoint path modes (Q5054763) (← links)
- The relationship between gossiping in vertex-disjoint paths mode and bisection width (Q5096906) (← links)
- (Q5197581) (← links)
- Complete rotations in Cayley graphs (Q5927685) (← links)
- Domination in Kn\"odel Graphs (Q6041432) (← links)
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs (Q6103475) (← links)
- Maximum subgraph problem for 3-regular Knödel graphs and its wirelength (Q6132556) (← links)
- Diameter of General Knödel Graphs (Q6145626) (← links)
