Compound constructions of broadcast networks

DOI10.1016/S0166-218X(99)00043-8MaRDI QIDQ1296577zbMATH OpenOpenAlexFDO

Authors Michael J. Dinneen, Mark C. Wilson, Golbon Zakeri, Jose 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

broadcastingcommunication networkminimum 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)

Recommendations

• Antepenultimate broadcasting
• An algorithm for constructing minimal \(c\)-broadcast networks
• scientific article; zbMATH DE number 3948154
• A new construction of broadcast graphs
• A new construction of broadcast graphs

Cites work

• scientific article; zbMATH DE number 4141826 (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 minimum broadcast graph on 63 vertices
• A new method for constructing minimal broadcast networks
• A survey of gossiping and broadcasting in communication networks
• Antepenultimate broadcasting
• Broadcasting in Bounded Degree Graphs
• Fault-tolerant broadcasting and gossiping in communication networks
• Information Dissemination in Trees
• Lower bounds for the size in four families of minimum broadcast graphs
• Methods and problems of communication in usual networks
• Minimal broadcast networks
• Minimum broadcast graphs
• On the construction of minimal broadcast networks
• Some minimum broadcast graphs
• Some minimum gossip graphs
• Sparse broadcast graphs
• Tight Bounds on Mimimum Broadcast Networks

Cited in

(21)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1296577)