The following pages link to Minimal broadcast networks (Q3861295):
Displaying 36 items.
- Binary linear programming models for robust broadcasting in communication networks (Q266832) (← links)
- The minimum broadcast time problem for several processor networks (Q672455) (← links)
- On the number of broadcast schemes in networks (Q845865) (← links)
- Broadcasting from multiple originators (Q967331) (← links)
- Extremal broadcasting problems (Q1120554) (← links)
- Sparse broadcast graphs (Q1192945) (← links)
- Broadcasting in DMA-bound bounded degree graphs (Q1199443) (← links)
- Minimum broadcast digraphs (Q1199444) (← links)
- Minimum broadcast graphs (Q1256494) (← links)
- Compound constructions of broadcast networks (Q1296577) (← links)
- On the construction of regular minimal broadcast digraphs (Q1318708) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- Broadcasting multiple messages in simultaneous send/receive systems (Q1339400) (← links)
- Bounded-call broadcasting (Q1339878) (← links)
- Minimum \(k\)-broadcast graphs (Q1339891) (← links)
- Time-relaxed broadcasting in communication networks (Q1392539) (← links)
- A survey on Knödel graphs. (Q1427198) (← links)
- Recursive circulants and their embeddings among hypercubes (Q1575703) (← links)
- A 1-relaxed minimum broadcast graph on 15 vertices. (Q1764502) (← links)
- Sparse hypercube -- a minimal \(k\)-line broadcast graph. (Q1811066) (← links)
- Bounded depth broadcasting (Q1917294) (← links)
- More broadcast graphs (Q1961235) (← links)
- The complexity of finding a broadcast center (Q2151362) (← links)
- A new construction of broadcast graphs (Q2181251) (← links)
- Efficient construction of broadcast graphs (Q2449099) (← links)
- Diametral broadcast graphs (Q2449105) (← links)
- A New Construction of Broadcast Graphs (Q2795946) (← links)
- Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs (Q2971647) (← links)
- Time-Efficient Broadcast in Radio Networks (Q3404475) (← links)
- Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT) (Q3438992) (← links)
- A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS (Q3503008) (← links)
- Broadcasting in Trees with Multiple Originators (Q3950477) (← links)
- (Q4519135) (← links)
- Degree- and time-constrained broadcast networks (Q4537618) (← links)
- Broadcasting in general networks I: Trees (Q6085744) (← links)
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs (Q6103475) (← links)
