Efficient broadcast trees for weighted vertices
From MaRDI portal
Publication:516786
DOI10.1016/J.DAM.2016.09.029zbMATH Open1358.05279OpenAlexW2532807735MaRDI QIDQ516786FDOQ516786
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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
- Efficient construction of broadcast graphs
- A survey of gossiping and broadcasting in communication networks
- Information Dissemination in Trees
- Upper bounds on the broadcast function using minimum dominating sets
- Tight Bounds on Mimimum Broadcast Networks
- Methods and problems of communication in usual networks
- Title not available (Why is that?)
- Extremal broadcasting problems
- Optimum broadcasting in complete weighted-vertex graphs
- Message Multicasting in Heterogeneous Networks
- A Cure for the Telephone Disease
Cited In (6)
- 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
- New upper bound on \(m\)-time-relaxed \(k\)-broadcast graphs
- 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)
