The following pages link to Sparse broadcast graphs (Q1192945):
Displaying 36 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)
- Minimum multiple originator broadcast graphs (Q516794) (← links)
- On time-relaxed broadcasting networks (Q708331) (← links)
- On the number of broadcast schemes in networks (Q845865) (← links)
- Broadcasting from multiple originators (Q967331) (← links)
- Broadcasting and spanning trees in de Bruijn and Kautz networks (Q1199434) (← links)
- Broadcasting in DMA-bound bounded degree graphs (Q1199443) (← links)
- Minimum broadcast digraphs (Q1199444) (← links)
- Compound constructions of broadcast networks (Q1296577) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- Bounded-call broadcasting (Q1339878) (← links)
- Minimum \(k\)-broadcast graphs (Q1339891) (← links)
- A minimum broadcast graph on 63 vertices (Q1339894) (← links)
- Some minimum broadcast graphs (Q1339895) (← links)
- Time-relaxed broadcasting in communication networks (Q1392539) (← links)
- The even adjacency split problem for graphs (Q1566571) (← links)
- On the structure of minimum broadcast digraphs (Q1575743) (← 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-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT) (Q3438992) (← links)
- A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS (Q3503008) (← links)
- Degree- and time-constrained broadcast networks (Q4537618) (← links)
- (Q4764627) (← links)
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs (Q6103475) (← links)
- New upper bound on \(m\)-time-relaxed \(k\)-broadcast graphs (Q6496344) (← links)
- On broadcast schemes of Knödel graphs (Q6656780) (← links)
