scientific article; zbMATH DE number 1885942

MaRDI QIDQ4798524zbMATH OpenFDO

Authors Yehuda Roditty, B. Shoham, Amir Averbuch

Publication date 18 June 2003

zbMATH Keywords

broadcast graphminimum broadcast tree

Mathematics Subject Classification ID

Applications of graph theory (05C90) Network design and communication in computer systems (68M10) Distributed systems (68M14) Communication networks in operations research (90B18)

Recommendations

• Time-relaxed broadcasting in communication networks
• A new method for constructing minimal broadcast networks
• Broadcast networks with near optimal cost
• Minimum \(k\)-broadcast graphs
• A 1-relaxed minimum broadcast graph on 15 vertices.

Cited in

(9)

• Minimum-time multidrop broadcast
• Time-relaxed broadcasting in communication networks
• A 1-relaxed minimum broadcast graph on 15 vertices.
• Binary linear programming models for robust broadcasting in communication networks
• scientific article; zbMATH DE number 3948154 (Why is no real title available?)
• Broadcast networks with near optimal cost
• Efficient line broadcasting in a \(d\)-dimensional grid
• Time-relaxed 1-fault tolerant broadcast networks
• New upper bound on m-time-relaxed k-broadcast graphs

This page was built for publication:

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