The following pages link to (Q4870160):
Displayed 50 items.
- Hierarchical broadcast networks (Q293474) (← links)
- All-to-all broadcast problem of some classes of graphs under the half duplex all-port model (Q400494) (← links)
- Upper bounds on the broadcast function using minimum dominating sets (Q456886) (← links)
- The worst case behavior of randomized gossip protocols (Q477180) (← links)
- Odd gossiping (Q516782) (← 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)
- On the number of broadcast schemes in networks (Q845865) (← links)
- Robust gossiping with an application to consensus (Q856404) (← links)
- On the complexity of the shortest-path broadcast problem (Q896659) (← 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)
- A note on the lower bound of centralized radio broadcasting for planar reachability graphs (Q1028487) (← links)
- On broadcasting in unicyclic graphs (Q1029711) (← links)
- Optimal sequential gossiping by short messages (Q1270817) (← links)
- Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
- Symmetric flows and broadcasting in hypercubes (Q1296143) (← links)
- Compound constructions of broadcast networks (Q1296577) (← links)
- On the communication complexity of polling (Q1350916) (← links)
- Periodic gossiping in back-to-back trees (Q1363646) (← links)
- Minimum time broadcast in faulty star networks (Q1392530) (← links)
- Broadcasting and gossiping on de Bruijn, shuffle-exchange and similar networks (Q1392538) (← links)
- Deterministic broadcasting time with partial knowledge of the network. (Q1401209) (← links)
- Gossiping and broadcasting versus computing functions in networks. (Q1427193) (← links)
- Dynamic faults have small effect on broadcasting in hypercubes. (Q1427194) (← links)
- A survey on Knödel graphs. (Q1427198) (← links)
- Efficient collective communciation in optical networks (Q1575944) (← links)
- Verifiable broadcasting and gossiping in communication networks (Q1602698) (← 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)
- On linear-time data dissemination in dynamic rooted trees (Q1727754) (← links)
- Lower bounds on systolic gossip (Q1763428) (← links)
- A note on line broadcast in digraphs under the edge-disjoint paths mode (Q1765240) (← links)
- Faster gossiping on butterfly networks (Q1770425) (← links)
- Sparse hypercube -- a minimal \(k\)-line broadcast graph. (Q1811066) (← links)
- Optimal gossiping in paths and cycles (Q1827271) (← links)
- Optimal broadcast on parallel locality models (Q1827284) (← links)
- Broadcast time and connectivity (Q1887074) (← links)
- Search on a line with faulty robots (Q2010608) (← links)
- The complexity of finding a broadcast center (Q2151362) (← links)
- On the radius of nonsplit graphs and information dissemination in dynamic networks (Q2185751) (← links)
- The logic of gossiping (Q2211849) (← links)
- 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)