Optimum broadcasting in complete weighted-vertex graphs

DOI10.1007/978-3-642-11266-9_41MaRDI QIDQ3401112zbMATH OpenOpenAlexFDO

Authors Hovhannes A. Harutyunyan, Shahin Kamali

Publication date 28 January 2010

Published in SOFSEM 2010: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-11266-9_41

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Nonnumerical algorithms (68W05)

Recommendations

• Efficient broadcast trees for weighted vertices
• Broadcasting in weighted trees under the postal model
• Weighted broadcast in linear radio networks
• Computation of broadcasting multiple messages in a positive weighted tree
• Broadcasting in heterogeneous tree networks

Cited in

(5)

• scientific article; zbMATH DE number 5139470 (Why is no real title available?)
• Efficient broadcast trees for weighted vertices
• Power surplus solutions for weighted hypergraph communication situations
• New upper bound on m-time-relaxed k-broadcast graphs
• Optimal and near-optimal broadcast in random graphs

This page was built for publication: Optimum broadcasting in complete weighted-vertex graphs

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