Efficient broadcast trees for weighted vertices

DOI10.1016/J.DAM.2016.09.029MaRDI QIDQ516786zbMATH OpenOpenAlexFDO

Authors Hovhannes A. Harutyunyan, Shahin Kamali

Publication date 15 March 2017

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2016.09.029

zbMATH Keywords

graph algorithmsbroadcastinginformation disseminationnetwork design

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10)

Recommendations

• Optimum broadcasting in complete weighted-vertex graphs
• Broadcasting in weighted trees under the postal model
• Information dissemination in weighted trees
• Broadcasting in heterogeneous tree networks
• Computation of broadcasting multiple messages in a positive weighted tree

Cites work

• scientific article; zbMATH DE number 2079323 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• A Cure for the Telephone Disease
• A survey of gossiping and broadcasting in communication networks
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Efficient construction of broadcast graphs
• Extremal broadcasting problems
• Information Dissemination in Trees
• Message Multicasting in Heterogeneous Networks
• Methods and problems of communication in usual networks
• Optimum broadcasting in complete weighted-vertex graphs
• Tight Bounds on Mimimum Broadcast Networks
• Upper bounds on the broadcast function using minimum dominating sets

Cited in

(9)

• Biased random-key genetic algorithms for the weighted minimum broadcast time problem
• Optimum broadcasting in complete weighted-vertex graphs
• Information dissemination in weighted trees
• Broadcasting in heterogeneous tree networks
• An Efficient Vertex Addition Method for Broadcast Networks
• The broadcast median problem in heterogeneous postal model
• New upper bound on m-time-relaxed k-broadcast graphs
• Broadcasting in weighted trees under the postal model
• Computation of broadcasting multiple messages in a positive weighted tree

This page was built for publication: Efficient broadcast trees for weighted vertices

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