scientific article; zbMATH DE number 961881
From MaRDI portal
Publication:5689764
Recommendations
Cited in
(23)- Rapid almost-complete broadcasting in faulty networks
- Communication complexity of fault-tolerant information diffusion
- Minimum congestion redundant assignments to tolerate random faults
- Minimum time broadcast in faulty star networks
- Verifiable broadcasting and gossiping in communication networks
- Domination in 4-regular Knödel graphs
- More broadcast graphs
- Binary linear programming models for robust broadcasting in communication networks
- A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS
- Deterministic Models of Communication Faults
- Fault-tolerant broadcast graphs
- scientific article; zbMATH DE number 4053528 (Why is no real title available?)
- Minimum Time Broadcast Networks Tolerating a Logarithmic Number of Faults
- Tighter time bounds on fault-tolerant broadcasting and gossiping
- Time bounds on fault‐tolerant broadcasting
- scientific article; zbMATH DE number 908506 (Why is no real title available?)
- scientific article; zbMATH DE number 935188 (Why is no real title available?)
- A strong connectivity property of the generalized exchanged hypercube
- Odd gossiping
- scientific article; zbMATH DE number 2197956 (Why is no real title available?)
- Time-relaxed 1-fault tolerant broadcast networks
- Fault-tolerant broadcasts
- On fractional dynamic faults with thresholds
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5689764)