Efficient construction of broadcast graphs

DOI10.1016/j.dam.2014.01.025zbMath1288.05133arXiv1312.1523OpenAlexW2076417432MaRDI QIDQ2449099

R. Hollander Shabtai, Yehuda Roditty, Amir Z. Averbuch

Publication date: 6 May 2014

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.1523

zbMATH Keywords

broadcastingminimum broadcast graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (10)

Binary linear programming models for robust broadcasting in communication networks ⋮ The complexity of finding a broadcast center ⋮ A new construction of broadcast graphs ⋮ Broadcast graphs using new dimensional broadcast schemes for Knödel graphs ⋮ Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ Efficient broadcast trees for weighted vertices ⋮ Minimum multiple originator broadcast graphs ⋮ Modelling simultaneous broadcasting by level-disjoint partitions ⋮ A New Construction of Broadcast Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Upper bounds on the broadcast function using minimum dominating sets
• Sparse broadcast graphs
• Minimum broadcast graphs
• Compound constructions of broadcast networks
• A survey on Knödel graphs.
• On the monotonicity of the broadcast function
• More broadcast graphs
• An Efficient Vertex Addition Method for Broadcast Networks
• Minimal broadcast networks
• A Note on the Dimensionality of Modified Knödel Graphs
• Antepenultimate broadcasting
• Tight Bounds on Mimimum Broadcast Networks

This page was built for publication: Efficient construction of broadcast graphs