Pages that link to "Item:Q1339884"
From MaRDI portal
The following pages link to Methods and problems of communication in usual networks (Q1339884):
Displaying 50 items.
- Hierarchical broadcast networks (Q293474) (← links)
- On edge-disjoint spanning trees with small depths (Q294801) (← links)
- All-to-all broadcast problem of some classes of graphs under the half duplex all-port model (Q400494) (← links)
- Optimal broadcast for fully connected processor-node networks (Q436809) (← 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)
- Efficient broadcast trees for weighted vertices (Q516786) (← links)
- Minimum multiple originator broadcast graphs (Q516794) (← links)
- Messy broadcasting - decentralized broadcast schemes with limited knowledge (Q628314) (← links)
- Parsimonious flooding in dynamic graphs (Q661047) (← links)
- Rooted level-disjoint partitions of Cartesian products (Q669354) (← links)
- Optimal broadcasting in the back to back d-ary trees (Q671386) (← links)
- On the number of broadcast schemes in networks (Q845865) (← links)
- Robust gossiping with an application to consensus (Q856404) (← links)
- An online distributed gossiping protocol for mobile networks (Q857763) (← links)
- On the complexity of the shortest-path broadcast problem (Q896659) (← links)
- All-to-all broadcast problems on Cartesian product graphs (Q897889) (← 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)
- The hierarchical product of graphs (Q1003753) (← links)
- On broadcasting in unicyclic graphs (Q1029711) (← links)
- Cayley graphs as classifiers for data mining: the influence of asymmetries (Q1044901) (← 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)
