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

DOI10.1016/j.dam.2008.09.002zbMath1163.94336OpenAlexW2083522429MaRDI QIDQ1028487

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

zbMATH Keywords

planar graphradio networkscentralized broadcasting

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A lower bound for radio broadcast
• Optimal deterministic broadcasting in known topology radio networks
• Centralized asynchronous broadcast in radio networks
• Centralized broadcast in multihop radio networks
• Faster communication in known topology radio networks
• Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

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