Lower bounds for the size in four families of minimum broadcast graphs
From MaRDI portal
Publication:1916125
DOI10.1016/0012-365X(95)00200-GzbMath0859.05052MaRDI QIDQ1916125
Publication date: 7 April 1997
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (12)
On the number of broadcast schemes in networks ⋮ Lower bounds for the size in four families of minimum broadcast graphs ⋮ A new construction of broadcast graphs ⋮ Tight lower bounds on broadcast function for \(n = 24\) and 25 ⋮ Broadcast graphs using new dimensional broadcast schemes for Knödel graphs ⋮ Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs ⋮ More broadcast graphs ⋮ Broadcasting from multiple originators ⋮ A 1-relaxed minimum broadcast graph on 15 vertices. ⋮ A New Construction of Broadcast Graphs ⋮ On the structure of minimum broadcast digraphs ⋮ Compound constructions of broadcast networks
Cites Work
This page was built for publication: Lower bounds for the size in four families of minimum broadcast graphs
