More broadcast graphs
From MaRDI portal
Publication:1961235
DOI10.1016/S0166-218X(99)00108-0zbMath0936.05059OpenAlexW2166684835MaRDI QIDQ1961235
Arthur L. Liestman, Hovhannes A. Harutyunyan
Publication date: 8 May 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00108-0
Related Items (17)
Binary linear programming models for robust broadcasting in communication networks ⋮ On the number of broadcast schemes in networks ⋮ The complexity of finding a broadcast center ⋮ A new construction of broadcast graphs ⋮ Tight lower bounds on broadcast function for \(n = 24\) and 25 ⋮ A COMPOUNDING ALGORITHM FOR 1-FAULT TOLERANT BROADCAST NETWORKS ⋮ Broadcast graphs using new dimensional broadcast schemes for Knödel graphs ⋮ Broadcast Graphs Using New Dimensional Broadcast Schemes for Knödel Graphs ⋮ Upper bounds on the broadcast function using minimum dominating sets ⋮ Efficient construction of broadcast graphs ⋮ Diametral broadcast graphs ⋮ On linear-time data dissemination in dynamic rooted trees ⋮ Broadcasting from multiple originators ⋮ The shortest path problem in the Knödel graph ⋮ A New Construction of Broadcast Graphs ⋮ Sparse hypercube -- a minimal \(k\)-line broadcast graph. ⋮ Total domination in cubic Knodel graphs
Cites Work
- Sparse broadcast graphs
- New gossips and telephones
- Minimum broadcast graphs
- Compound constructions of broadcast networks
- A minimum broadcast graph on 63 vertices
- Some minimum broadcast graphs
- Lower bounds for the size in four families of minimum broadcast graphs
- A survey of gossiping and broadcasting in communication networks
- On the construction of minimal broadcast networks
- Minimal broadcast networks
- Broadcasting in Bounded Degree Graphs
- A Note on the Dimensionality of Modified Knödel Graphs
- Antepenultimate broadcasting
- Tight Bounds on Mimimum Broadcast Networks
- A new method for constructing minimal broadcast networks
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: More broadcast graphs
