A note to non-adaptive broadcasting

DOI10.1142/S0129626423400170MaRDI QIDQ6536205FDO

Authors Saber Gholami, Hovhannes A. Harutyunyan

Publication date 9 April 2024

Published in Parallel Processing Letters (Search for Journal in Brave)

zbMATH Keywords

broadcastingnon-adaptivityuniversal lists

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

Recommendations

• Nonadaptive broadcasting in trees
• Broadcasting with universal lists
• scientific article; zbMATH DE number 2068168
• Optimal broadcasting with universal lists based on competitive analysis*
• scientific article; zbMATH DE number 2080980

Cites work

• scientific article; zbMATH DE number 3666695 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1775430 (Why is no real title available?)
• scientific article; zbMATH DE number 7526289 (Why is no real title available?)
• A Combinatorial Logarithmic Approximation Algorithm for the Directed Telephone Broadcast Problem
• A survey of gossiping and broadcasting in communication networks
• An efficient heuristic for broadcasting in networks
• Approximation Algorithms for Minimum-Time Broadcast
• Approximation algorithms in graphs with known broadcast time of the base graph
• Broadcast Networks of Bounded Degree
• Broadcasting with universal lists
• Constant approximation for broadcasting in \(k\)-cycle graph
• Information Dissemination in Trees
• Linear Algorithm for Broadcasting in Unicyclic Graphs
• Minimum broadcast time is NP-complete for 3-regular planar graphs and deadline 2
• Nonadaptive broadcasting in trees
• On broadcasting in unicyclic graphs
• Optimal algorithms for dissemination of information in some interconnection networks
• Optimal broadcasting with universal lists based on competitive analysis*
• Spanning tree modulus for secure broadcast games
• Sublogarithmic approximation for telephone multicast
• The complexity of broadcasting in planar and decomposable graphs

Cited in

(1)

• On broadcast schemes of Knödel graphs

This page was built for publication: A note to non-adaptive broadcasting

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