On time-relaxed broadcasting networks

DOI10.1016/J.DAM.2010.02.002zbMATH Open1210.05168OpenAlexW2022804278MaRDI QIDQ708331FDOQ708331

Authors: Tianxing Yao, P. C. B. Lam, Wensong Lin, Guofei Zhou 

Publication date: 11 October 2010

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

Full work available at URL: https://doi.org/10.1016/j.dam.2010.02.002

Recommendations

• Time-relaxed broadcasting in communication networks
• A 1-relaxed minimum broadcast graph on 15 vertices.
• More broadcast graphs
• Broadcast Networks of Bounded Degree
• Sparse broadcast graphs

zbMATH Keywords

broadcasting\(t\)-relaxed broadcastingbroadcast graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Applications of graph theory to circuits and networks (94C15)

Cites Work

• Time-relaxed broadcasting in communication networks
• A 1-relaxed minimum broadcast graph on 15 vertices.
• Tight Bounds on Mimimum Broadcast Networks

Cited In (6)

• Binary linear programming models for robust broadcasting in communication networks
• Tight lower bounds on broadcast function for \(n = 24\) and 25
• Simultaneous broadcast revisited
• A 1-relaxed minimum broadcast graph on 15 vertices.
• Algorithms - ESA 2003
• New upper bound on \(m\)-time-relaxed \(k\)-broadcast graphs

This page was built for publication: On time-relaxed broadcasting networks

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