A note on the lower bound of centralized radio broadcasting for planar reachability graphs

DOI10.1016/J.DAM.2008.09.002zbMATH Open1163.94336OpenAlexW2083522429MaRDI QIDQ1028487FDOQ1028487

Authors: František Galčík 

Publication date: 30 June 2009

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2008.09.002

Recommendations

• scientific article; zbMATH DE number 1191227
• STACS 2004
• A lower bound for radio broadcast
• Broadcasting in undirected ad hoc radio networks
• Faster communication in known topology radio networks

zbMATH Keywords

planar graphradio networkscentralized broadcasting

Mathematics Subject Classification ID

Applications of graph theory (05C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Planar graphs; geometric and topological aspects of graph theory (05C10) Communication networks in operations research (90B18)

Cites Work

• Optimal deterministic broadcasting in known topology radio networks
• Title not available (Why is that?)
• A lower bound for radio broadcast
• Faster communication in known topology radio networks
• Improved schedule for radio broadcast
• Centralized broadcast in multihop radio networks
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
• Centralized asynchronous broadcast in radio networks

This page was built for publication: A note on the lower bound of centralized radio broadcasting for planar reachability graphs

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