Pages that link to "Item:Q5689764"
From MaRDI portal
The following pages link to Fault-tolerant minimum broadcast networks (Q5689764):
Displaying 18 items.
- Binary linear programming models for robust broadcasting in communication networks (Q266832) (← links)
- A strong connectivity property of the generalized exchanged hypercube (Q516776) (← links)
- Odd gossiping (Q516782) (← links)
- Fault-tolerant broadcasts (Q790609) (← links)
- On fractional dynamic faults with thresholds (Q930907) (← links)
- Rapid almost-complete broadcasting in faulty networks (Q1008737) (← links)
- Communication complexity of fault-tolerant information diffusion (Q1274923) (← links)
- Minimum congestion redundant assignments to tolerate random faults (Q1348940) (← links)
- Minimum time broadcast in faulty star networks (Q1392530) (← links)
- Verifiable broadcasting and gossiping in communication networks (Q1602698) (← links)
- Domination in 4-regular Knödel graphs (Q1738162) (← links)
- More broadcast graphs (Q1961235) (← links)
- A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS (Q3503008) (← links)
- Deterministic Models of Communication Faults (Q3599115) (← links)
- Fault-tolerant broadcast graphs (Q3703811) (← links)
- Tighter time bounds on fault-tolerant broadcasting and gossiping (Q4014613) (← links)
- Time bounds on fault‐tolerant broadcasting (Q4732294) (← links)
- Time-relaxed 1-fault tolerant broadcast networks (Q6483537) (← links)