Broadcast problem in hypercube of trees

DOI10.1007/978-3-319-08016-1_1MaRDI QIDQ3188828zbMATH OpenOpenAlexFDO

Authors Puspal Bhabak, Hovhannes A. Harutyunyan

Publication date 2 September 2014

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08016-1_1

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Network design and communication in computer systems (68M10) Approximation algorithms (68W25)

Recommendations

• Linear Algorithm for Broadcasting in Unicyclic Graphs
• Extremal broadcasting problems
• On broadcasting in unicyclic graphs
• Constant approximation for broadcasting in k-cycle graph
• Broadcasting in heterogeneous tree networks

Cited in

(13)

• On broadcasting in unicyclic graphs
• Broadcasting in unlabeled hypercubes with a linear number of messages.
• The optimal structure of information dissemination
• Linear Algorithm for Broadcasting in Unicyclic Graphs
• Approximating All-to-All Broadcast in Wireless Networks
• Information Dissemination in Trees
• scientific article; zbMATH DE number 6843211 (Why is no real title available?)
• The shared broadcast tree problem and MST
• Constant approximation for broadcasting in k-cycle graph
• Broadcasts and domination in trees
• Broadcasting in general networks I: Trees
• Approximation algorithms in graphs with known broadcast time of the base graph
• An efficient algorithm for multiple simultaneous broadcasts in the hypercube

This page was built for publication: Broadcast problem in hypercube of trees

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