On broadcast schemes of Knödel graphs
From MaRDI portal
Publication:6656780
Recommendations
Cites work
- scientific article; zbMATH DE number 1696530 (Why is no real title available?)
- scientific article; zbMATH DE number 3702701 (Why is no real title available?)
- scientific article; zbMATH DE number 177869 (Why is no real title available?)
- scientific article; zbMATH DE number 857072 (Why is no real title available?)
- A Note on the Dimensionality of Modified Knödel Graphs
- A survey of gossiping and broadcasting in communication networks
- A survey on Knödel graphs.
- An Efficient Vertex Addition Method for Broadcast Networks
- Antepenultimate broadcasting
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
- Complete rotations in Cayley graphs
- Compound constructions of broadcast networks
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- Methods and problems of communication in usual networks
- Minimum broadcast graphs
- Minimum multiple message broadcast graphs
- More broadcast graphs
- New gossips and telephones
- On the monotonicity of the broadcast function
- Sparse broadcast graphs
- The shortest path problem in the Knödel graph
- Upper bounds on the broadcast function using minimum dominating sets
This page was built for publication: On broadcast schemes of Knödel graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6656780)
