The following pages link to More broadcast graphs (Q1961235):
Displaying 23 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)
- Upper bounds on the broadcast function using minimum dominating sets (Q456886) (← links)
- On time-relaxed broadcasting networks (Q708331) (← links)
- On the number of broadcast schemes in networks (Q845865) (← links)
- Broadcasting from multiple originators (Q967331) (← links)
- Set to set broadcasting in communication networks (Q1208457) (← links)
- The broadcast function value \(B(23)\) is \(33\) or \(34\). (Q1582579) (← links)
- On linear-time data dissemination in dynamic rooted trees (Q1727754) (← links)
- Sparse hypercube -- a minimal \(k\)-line broadcast graph. (Q1811066) (← links)
- Broadcast time and connectivity (Q1887074) (← links)
- Lower bounds for the size in four families of minimum broadcast graphs (Q1916125) (← 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)
- A New Construction of Broadcast Graphs (Q2795946) (← links)
- Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs (Q2971647) (← links)
- A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS (Q3503008) (← links)
- Total domination in cubic Knodel graphs (Q4957563) (← links)
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs (Q6103475) (← links)
- On broadcast schemes of Knödel graphs (Q6656780) (← links)
