Broadcasting with universal lists

DOI10.1002/(SICI)1097-0037(199605)27:3%3C183::AID-NET3%3E3.0.CO;2-EMaRDI QIDQ4887749zbMATHOpenAlexFDO

Authors Krzysztof Diks, Andrzej Pelc

Publication date 25 November 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0037(199605)27:3%3C183::aid-net3%3E3.0.co;2-e

zbMATH Keywords

treesbroadcastingcommunication networkgridsrings

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Recommendations

• scientific article; zbMATH DE number 2080980
• Optimal broadcasting with universal lists based on competitive analysis*
• Broadcast Networks of Bounded Degree
• scientific article; zbMATH DE number 4102999
• Perfect broadcasting in unlabeled networks

Cited in

(8)

• Finding broadcast 2-centers of a tree under the postal model
• scientific article; zbMATH DE number 2080980 (Why is no real title available?)
• scientific article; zbMATH DE number 2089982 (Why is no real title available?)
• A note to non-adaptive broadcasting
• Source-oblivious broadcast
• TIME AND ENERGY OPTIMAL LIST RANKING ALGORITHMS ON THE k-CHANNEL BROADCAST COMMUNICATION MODEL WITH NO COLLISION DETECTION
• Optimal broadcasting with universal lists based on competitive analysis*
• Nonadaptive broadcasting in trees

This page was built for publication: Broadcasting with universal lists

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