Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

The time complexity of deterministic broadcast radio networks

From MaRDI portal
Publication:1894365
Jump to:navigation, search

DOI10.1016/0166-218X(94)00053-GzbMath0836.68055OpenAlexW2056597233MaRDI QIDQ1894365

Frank K. Hwang

Publication date: 6 September 1995

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

Full work available at URL: https://doi.org/10.1016/0166-218x(94)00053-g


zbMATH Keywords

multihop networktime complexity of broadcast


Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18)


Related Items (3)

Deterministic broadcasting in ad hoc radio networks ⋮ On the effect of the deployment setting on broadcasting in Euclidean radio networks ⋮ Time-Efficient Broadcast in Radio Networks




Cites Work

  • On the time-complexity of broadcast in multi-hop radio networks: An exponential gap between determinism and randomization




This page was built for publication: The time complexity of deterministic broadcast radio networks

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1894365&oldid=14300775"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
This page was last edited on 1 February 2024, at 12:18.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki