Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

On time-relaxed broadcasting networks

From MaRDI portal
Publication:708331
Jump to:navigation, search

DOI10.1016/J.DAM.2010.02.002zbMath1210.05168OpenAlexW2022804278MaRDI QIDQ708331

Peter Che Bor Lam, Tianxing Yao, Wensong Lin, Guo-fei 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


zbMATH Keywords

broadcast graphbroadcasting\(t\)-relaxed broadcasting


Mathematics Subject Classification ID

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


Related Items (2)

Binary linear programming models for robust broadcasting in communication networks ⋮ Tight lower bounds on broadcast function for \(n = 24\) and 25




Cites Work

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




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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:708331&oldid=12623228"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 30 January 2024, at 09:59.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki