An efficient heuristic for broadcasting in networks

DOI10.1016/J.JPDC.2005.06.010MaRDI QIDQ2369649zbMATH OpenOpenAlexFDO

Authors Hovhannes A. Harutyunyan, Bin Shao

Publication date 22 May 2006

Published in Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jpdc.2005.06.010

zbMATH Keywords

algorithmbroadcastheuristicnetwork

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• Broadcasting in heterogeneous networks
• Broadcast Networks of Bounded Degree
• scientific article; zbMATH DE number 6469246
• scientific article; zbMATH DE number 4102999
• Linear Algorithm for Broadcasting in Unicyclic Graphs

Cited in

(11)

• On broadcasting in unicyclic graphs
• An Efficient Vertex Addition Method for Broadcast Networks
• scientific article; zbMATH DE number 1292975 (Why is no real title available?)
• Broadcasting on cactus graphs
• A linear algorithm for finding the k‐broadcast center of a tree
• Broadcasting in weighted trees under the postal model
• Tighter bounds on the minimum broadcast time
• A note to non-adaptive broadcasting
• Strong bounds and exact solutions to the minimum broadcast time problem
• Broadcasting two messages in wheel graphs
• On the number of broadcast schemes in networks

This page was built for publication: An efficient heuristic for broadcasting in networks

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