scientific article; zbMATH DE number 1885942

zbMATH Open1027.90010MaRDI QIDQ4798524FDOQ4798524

Authors: Yehuda Roditty, B. Shoham, Amir Averbuch 

Publication date: 18 June 2003

Title of this publication is not available (Why is that?)

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.

zbMATH Keywords

broadcast graphminimum broadcast tree

Mathematics Subject Classification ID

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

Cited In (8)

• Binary linear programming models for robust broadcasting in communication networks
• Minimum-time multidrop broadcast
• A 1-relaxed minimum broadcast graph on 15 vertices.
• Broadcast networks with near optimal cost
• Efficient line broadcasting in a \(d\)-dimensional grid
• Title not available (Why is that?)
• 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)