Pages that link to "Item:Q5202962"
From MaRDI portal
The following pages link to Tight Bounds on Mimimum Broadcast Networks (Q5202962):
Displaying 36 items.
- Binary linear programming models for robust broadcasting in communication networks (Q266832) (← links)
- Hierarchical broadcast networks (Q293474) (← links)
- Upper bounds on the broadcast function using minimum dominating sets (Q456886) (← links)
- Efficient broadcast trees for weighted vertices (Q516786) (← links)
- The minimum broadcast time problem for several processor networks (Q672455) (← links)
- On time-relaxed broadcasting networks (Q708331) (← links)
- Broadcasting from multiple originators (Q967331) (← links)
- An approximation algorithm and dynamic programming for reduction in heterogeneous environments (Q1024788) (← links)
- Sparse broadcast graphs (Q1192945) (← 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)
- Minimum \(k\)-broadcast graphs (Q1339891) (← 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)
- More broadcast graphs (Q1961235) (← links)
- The complexity of finding a broadcast center (Q2151362) (← links)
- A new construction of broadcast graphs (Q2181251) (← links)
- Gossip Latin square and the meet-all gossipers problem (Q2348701) (← links)
- Efficient construction of broadcast graphs (Q2449099) (← links)
- Diametral broadcast graphs (Q2449105) (← links)
- Improved upper and lower bounds fork-broadcasting (Q2714909) (← links)
- An algorithm for constructing minimalc-broadcast networks (Q2747800) (← links)
- k-Broadcasting in trees (Q2764999) (← 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 linear algorithm for finding the <i>k</i>‐broadcast center of a tree (Q5191149) (← links)
- Broadcasting in general networks I: Trees (Q6085744) (← 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)
