Broadcasting with universal lists

DOI10.1002/(SICI)1097-0037(199605)27:3%3C183::AID-NET3%3E3.0.CO;2-EzbMATH Open0851.90037OpenAlexW2109487005MaRDI QIDQ4887749FDOQ4887749

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

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

zbMATH Keywords

treesbroadcastingcommunication networkgridsrings

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Cited In (8)

• Nonadaptive broadcasting in trees
• Finding broadcast 2-centers of a tree under the postal model
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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*
• Source-oblivious broadcast
• A note to non-adaptive broadcasting

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)