The following pages link to (Q4038748):
Displaying 26 items.
- An approximation algorithm and dynamic programming for reduction in heterogeneous environments (Q1024788) (← links)
- Sparse broadcast graphs (Q1192945) (← links)
- Compound constructions of broadcast networks (Q1296577) (← links)
- Graph theoretical issues in computer networks (Q1319540) (← links)
- Reliable broadcasting (Q1339885) (← links)
- A minimum broadcast graph on 63 vertices (Q1339894) (← links)
- Time-relaxed broadcasting in communication networks (Q1392539) (← links)
- A survey on Knödel graphs. (Q1427198) (← links)
- Sparse hypercube -- a minimal \(k\)-line broadcast graph. (Q1811066) (← links)
- Lower bounds for the size in four families of minimum broadcast graphs (Q1916125) (← links)
- Bounded depth broadcasting (Q1917294) (← links)
- More broadcast graphs (Q1961235) (← links)
- The shortest path problem in the Knödel graph (Q2018539) (← 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)
- An Efficient Vertex Addition Method for Broadcast Networks (Q3400884) (← links)
- Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT) (Q3438992) (← links)
- Algebraic foundations and broadcasting algorithms for wormhole-routed all-port tori (Q4571355) (← links)
- Riemannian geometry of bicovariant group lattices (Q4833114) (← links)
- Some minimum gossip graphs (Q5289378) (← links)
- Minimum multiple message broadcast graphs (Q5487809) (← links)
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs (Q6103475) (← links)
- On broadcast schemes of Knödel graphs (Q6656780) (← links)
