Efficient broadcast trees for weighted vertices

DOI10.1016/j.dam.2016.09.029zbMath1358.05279OpenAlexW2532807735MaRDI QIDQ516786

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 algorithmsnetwork designbroadcastinginformation dissemination

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Upper bounds on the broadcast function using minimum dominating sets
• Extremal broadcasting problems
• Methods and problems of communication in usual networks
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Efficient construction of broadcast graphs
• Optimum Broadcasting in Complete Weighted-Vertex Graphs
• A survey of gossiping and broadcasting in communication networks
• Information Dissemination in Trees
• Message Multicasting in Heterogeneous Networks
• Tight Bounds on Mimimum Broadcast Networks
• A Cure for the Telephone Disease

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