Broadcast schemes of hypercubes
From MaRDI portal
Cites work
- A new construction of broadcast graphs
- A survey of gossiping and broadcasting in communication networks
- Antepenultimate broadcasting
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
- Combinatorial logarithmic approximation algorithm for directed telephone broadcast problem
- Compound constructions of broadcast networks
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- Efficient construction of broadcast graphs
- scientific article; zbMATH DE number 177869 (Why is no real title available?)
- scientific article; zbMATH DE number 1775430 (Why is no real title available?)
- scientific article; zbMATH DE number 857072 (Why is no real title available?)
- Information Dissemination in Trees
- Lower bounds for the size in four families of minimum broadcast graphs
- Methods and problems of communication in usual networks
- Minimum broadcast graphs
- Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
- More broadcast graphs
- New gossips and telephones
- On the construction of minimal broadcast networks
- Rotational Cayley graphs on transposition generated groups
- Sparse broadcast graphs
- Sublogarithmic approximation for telephone multicast
- Upper bounds on the broadcast function using minimum dominating sets
This page was built for publication: Broadcast schemes of hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232111)
