Pages that link to "Item:Q1339884"
From MaRDI portal
The following pages link to Methods and problems of communication in usual networks (Q1339884):
Displayed 50 items.
- Optimal broadcasting in the back to back d-ary trees (Q671386) (← links)
- Robust gossiping with an application to consensus (Q856404) (← links)
- An online distributed gossiping protocol for mobile networks (Q857763) (← links)
- A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem (Q932651) (← links)
- The hierarchical product of graphs (Q1003753) (← links)
- On XRAM and PRAM models, and on data-movement-intensive problems (Q1127554) (← links)
- Broadcasting in DMA-bound bounded degree graphs (Q1199443) (← links)
- Optimal sequential gossiping by short messages (Q1270817) (← links)
- Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
- Minimizing broadcast costs under edge reductions in tree networks (Q1283789) (← links)
- Symmetric flows and broadcasting in hypercubes (Q1296143) (← links)
- Compound constructions of broadcast networks (Q1296577) (← links)
- Two edge-disjoint hamiltonian cycles in the butterfly graph (Q1334638) (← links)
- Broadcasting in \(m\)-dimensional grid graphs with a given neighborhood template (Q1339877) (← links)
- Broadcasting in butterfly and deBruijn networks (Q1339890) (← links)
- On the communication complexity of polling (Q1350916) (← links)
- Periodic gossiping in back-to-back trees (Q1363646) (← links)
- A new digraphs composition with applications to de Bruijn and generalized de Bruijn digraphs (Q1364476) (← links)
- Broadcast and gossip in line-communication mode (Q1382273) (← links)
- Spanning subgraphs with applications to communication of a subclass of the Cayley-graph-based networks (Q1392529) (← links)
- Minimum time broadcast in faulty star networks (Q1392530) (← links)
- Broadcasting with linearly bounded transmission faults (Q1392531) (← links)
- Line broadcasting in cycles (Q1392536) (← 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)
- Orientations of digraphs almost preserving diameter (Q1613394) (← links)
- Lower bounds on systolic gossip (Q1763428) (← links)
- A note on line broadcast in digraphs under the edge-disjoint paths mode (Q1765240) (← links)
- Sparse hypercube -- a minimal \(k\)-line broadcast graph. (Q1811066) (← links)
- Optimal gossiping in paths and cycles (Q1827271) (← links)
- AT-free graphs: Linear bounds for the oriented diameter (Q1827858) (← links)
- Kernels of minimum size gossip schemes (Q1897431) (← links)
- Bounded depth broadcasting (Q1917294) (← links)
- On optimal orientations of Cartesian products with a bipartite graph (Q1961236) (← links)
- Optimal gossiping in square 2D meshes (Q2382678) (← links)
- On the spectra of hypertrees (Q2477529) (← links)
- Broadcasting in hypercubes and star graphs with dynamic faults. (Q2583571) (← links)
- Minimum linear gossip graphs and maximal linear (?,k)-gossip graphs (Q2764998) (← links)
- k-Broadcasting in trees (Q2764999) (← links)
- Multiple Routing Strategies in a Labelled Network (Q2765602) (← links)
- FAST BROADCASTING WITH BYZANTINE FAULTS (Q3421854) (← links)
- Lower and upper bounds for minimum energy broadcast and sensing problems in sensor networks† (Q3437345) (← links)
- Deterministic Models of Communication Faults (Q3599115) (← links)
- (Q4429298) (← links)