Nonadaptive broadcasting in trees

DOI10.1002/NET.20396MaRDI QIDQ3082604zbMATH OpenOpenAlexFDO

Authors Hovhannes A. Harutyunyan, Arthur L. Liestman, Kazuhisa Makino, Thomas C. Shermer

Publication date 16 March 2011

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.20396

zbMATH Keywords

broadcastingnonadaptivepathtreeuniversal list

Mathematics Subject Classification ID

Trees (05C05) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 2068168
• Extremal broadcasting problems
• Broadcasting in heterogeneous tree networks
• Broadcast Networks of Bounded Degree
• An optimal algorithm for broadcasting multiple messages in trees

Cites work

• A survey of gossiping and broadcasting in communication networks
• Broadcasting with universal lists
• Dissemination of information in communication networks. Broadcasting, gossiping, leader election, and fault-tolerance.
• Information Dissemination in Trees
• Methods and problems of communication in usual networks
• Optimal broadcasting with universal lists based on competitive analysis*

Cited in

(8)

• Event driven topology broadcast without sequence numbers
• scientific article; zbMATH DE number 2068168 (Why is no real title available?)
• scientific article; zbMATH DE number 2080980 (Why is no real title available?)
• Trade-offs between the size of advice and broadcasting time in trees
• Broadcasting in weighted trees under the postal model
• A note to non-adaptive broadcasting
• Finding broadcast 2-centers of a tree under the postal model
• Source-oblivious broadcast

This page was built for publication: Nonadaptive broadcasting in trees

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