An Efficient Vertex Addition Method for Broadcast Networks
From MaRDI portal
Recommendations
- Efficient construction of broadcast graphs
- Efficient broadcast trees for weighted vertices
- An efficient heuristic for broadcasting in networks
- scientific article; zbMATH DE number 2080256
- scientific article; zbMATH DE number 177869
- scientific article; zbMATH DE number 1875435
- Efficient broadcasting in an arrangement graph using multiple spanning trees
- scientific article; zbMATH DE number 6297797
- A broadcasting algorithm on the arrangement graph
Cited in
(17)- The shortest path problem in the Knödel graph
- A new construction of broadcast graphs
- Efficient construction of broadcast graphs
- Diametral broadcast graphs
- Binary linear programming models for robust broadcasting in communication networks
- A new construction of broadcast graphs
- On equitable colouring of Knödel graphs
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
- Tight lower bounds on broadcast function for n = 24 and 25
- Upper bounds on the broadcast function using minimum dominating sets
- Total domination in cubic Knodel graphs
- Broadcast networks with near optimal cost
- Broadcast graphs using new dimensional broadcast schemes for Knödel graphs
- On broadcast schemes of Knödel graphs
- Bounds on broadcast time in well-connected graphs
- Broadcast graph is NP-complete
- All sequential dimensional broadcast schemes in Knödel graphs
This page was built for publication: An Efficient Vertex Addition Method for Broadcast Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3400884)
