The following pages link to Minimum broadcast graphs (Q1256494):
Displaying 44 items.
- Binary linear programming models for robust broadcasting in communication networks (Q266832) (← links)
- Tight lower bounds on broadcast function for \(n = 24\) and 25 (Q401149) (← links)
- Minimum multiple originator broadcast graphs (Q516794) (← links)
- Optimal and near-optimal broadcast in random graphs (Q921019) (← links)
- Broadcasting from multiple originators (Q967331) (← links)
- Broadcasting with random faults (Q1111578) (← 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)
- Bounded-call broadcasting (Q1339878) (← links)
- Minimum \(k\)-broadcast graphs (Q1339891) (← links)
- Some minimum broadcast graphs (Q1339895) (← links)
- Broadcasting multiple messages in a grid (Q1339899) (← links)
- Time-relaxed broadcasting in communication networks (Q1392539) (← links)
- On the equality of the partial Grundy and upper ochromatic numbers of graphs (Q1415544) (← links)
- A survey on Knödel graphs. (Q1427198) (← links)
- On linear-time data dissemination in dynamic rooted trees (Q1727754) (← links)
- Sparse hypercube -- a minimal \(k\)-line broadcast graph. (Q1811066) (← links)
- Bounded depth broadcasting (Q1917294) (← links)
- More broadcast graphs (Q1961235) (← links)
- The shortest path problem in the Knödel graph (Q2018539) (← 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)
- An algorithm for constructing minimal \(c\)-broadcast networks (Q2747800) (← 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)
- Tighter time bounds on fault-tolerant broadcasting and gossiping (Q4014613) (← links)
- Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees (Q4537606) (← links)
- Efficient line broadcasting in a \(d\)-dimensional grid (Q5951959) (← links)
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs (Q6103475) (← links)
- Source-oblivious broadcast (Q6636076) (← links)
- On broadcast schemes of Knödel graphs (Q6656780) (← links)
- Upper bounds and approximation results for the \(k\)-slow burning problem (Q6671389) (← links)
