Compound constructions of broadcast networks

DOI10.1016/S0166-218X(99)00043-8zbMath0941.90009OpenAlexW2049528772MaRDI QIDQ1296577

Golbon Zakeri, Mark C. Wilson, Michael J. Dinneen, José A. Ventura

Publication date: 2 August 1999

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

Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00043-8

zbMATH Keywords

communication networkbroadcastingminimum broadcast graphgraph compound

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Communication theory (94A05)

Related Items (18)

Binary linear programming models for robust broadcasting in communication networks ⋮ Degree- and time-constrained broadcast networks ⋮ The complexity of finding a broadcast center ⋮ A new construction of broadcast graphs ⋮ Tight lower bounds on broadcast function for \(n = 24\) and 25 ⋮ A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS ⋮ Broadcast graphs using new dimensional broadcast schemes for Knödel graphs ⋮ Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs ⋮ Upper bounds on the broadcast function using minimum dominating sets ⋮ More broadcast graphs ⋮ Efficient construction of broadcast graphs ⋮ Minimum multiple originator broadcast graphs ⋮ An algorithm for constructing minimalc-broadcast networks ⋮ Broadcasting from multiple originators ⋮ A 1-relaxed minimum broadcast graph on 15 vertices. ⋮ The shortest path problem in the Knödel graph ⋮ A New Construction of Broadcast Graphs ⋮ Sparse hypercube -- a minimal \(k\)-line broadcast graph.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Sparse broadcast graphs
• Minimum broadcast graphs
• Methods and problems of communication in usual networks
• A minimum broadcast graph on 63 vertices
• Some minimum broadcast graphs
• Lower bounds for the size in four families of minimum broadcast graphs
• A survey of gossiping and broadcasting in communication networks
• On the construction of minimal broadcast networks
• Minimal broadcast networks
• Information Dissemination in Trees
• Broadcasting in Bounded Degree Graphs
• Antepenultimate broadcasting
• Tight Bounds on Mimimum Broadcast Networks
• Some minimum gossip graphs
• Fault-tolerant broadcasting and gossiping in communication networks
• A new method for constructing minimal broadcast networks

This page was built for publication: Compound constructions of broadcast networks