New upper bound on \(m\)-time-relaxed \(k\)-broadcast graphs

DOI10.1002/NET.21749MaRDI QIDQ6496344

Yehuda Roditty, Amir Z. Averbuch, Irete Peeri

Publication date: 3 May 2024

Published in: Networks (Search for Journal in Brave)

zbMATH Keywords

broadcasting\(k\)-broadcasting\(k\)-nomial tree\(m\)-time-relaxed \(k\)-broadcast graphs\(m\)-time-relaxed broadcasting\(Q^s\)-cube

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Upper bounds on the broadcast function using minimum dominating sets
• Efficient broadcast trees for weighted vertices
• Broadcasting on networks of workstations
• Broadcasting in heterogeneous networks
• Sparse broadcast graphs
• Broadcasting in DMA-bound bounded degree graphs
• Broadcasting multiple messages in a grid
• On broadcasting multiple messages in a \(d\)-dimensional grid
• Time-relaxed broadcasting in communication networks
• On the monotonicity of the broadcast function
• Optimal multiple message broadcasting in telephone-like communication systems
• Efficient construction of broadcast graphs
• Improved upper and lower bounds fork-broadcasting
• k-Broadcasting in trees
• Optimum Broadcasting in Complete Weighted-Vertex Graphs
• A survey of gossiping and broadcasting in communication networks
• Information Dissemination in Trees
• Multiple message broadcasting in communication networks
• Tight Bounds on Mimimum Broadcast Networks

This page was built for publication: New upper bound on \(m\)-time-relaxed \(k\)-broadcast graphs