The following pages link to (Q4870160):
Displaying 34 items.
- Group search of the plane with faulty robots (Q2326387) (← links)
- Optimal gossiping in square 2D meshes (Q2382678) (← links)
- Diametral broadcast graphs (Q2449105) (← links)
- Broadcasting in hypercubes and star graphs with dynamic faults. (Q2583571) (← links)
- Frobenius circulant graphs of valency six, Eisenstein-Jacobi networks, and hexagonal meshes (Q2637237) (← links)
- A distributed algorithm for directed minimum-weight spanning tree (Q2689838) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
- Spreading Messages (Q3511370) (← links)
- Deterministic Models of Communication Faults (Q3599115) (← links)
- A survey of gossiping and broadcasting in communication networks (Q3795460) (← links)
- Broadcasting and Gossiping in de Bruijn Networks (Q4286237) (← links)
- The complexity of systolic dissemination of information in interconnection networks (Q4365016) (← links)
- (Q4429298) (← links)
- Colouring paths in directed symmetric trees with applications to WDM routing (Q4571981) (← links)
- Fast gossiping by short messages (Q4645173) (← links)
- Gossiping and broadcasting versus computing functions in networks (Q5047171) (← links)
- Optimal algorithms for broadcast and gossip in the edge-disjoint path modes (Q5054763) (← links)
- Communication complexity of gossiping by packets (Q5054816) (← links)
- Concurrent multicast in weighted networks (Q5054855) (← links)
- Effective systolic algorithms for gossiping in cycles and two-dimensional grids (Q5055899) (← links)
- (Q5197581) (← links)
- Reliable broadcasting in double loop networks (Q5318271) (← links)
- Gathering in the plane of location-aware robots in the presence of spies (Q5918903) (← links)
- Concurrent multicast in weighted networks (Q5941285) (← links)
- Communication in the two-way listen-in vertex-disjoint paths mode (Q5941562) (← 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)
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs (Q6103475) (← links)
- Search on a Line by Byzantine Robots (Q6114825) (← links)
- Aggregation tree construction using hierarchical structures (Q6134051) (← links)
- Diameter of General Knödel Graphs (Q6145626) (← links)
- Finding broadcast 2-centers of a tree under the postal model (Q6585258) (← links)
- Strong bounds and exact solutions to the minimum broadcast time problem (Q6609717) (← links)
- On broadcast schemes of Knödel graphs (Q6656780) (← links)
