scientific article

zbMath1297.68041MaRDI QIDQ2921674

Michael Elkin, Guy Kortsarz

Publication date: 13 October 2014

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Planar graphs; geometric and topological aspects of graph theory (05C10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Related Items (25)

Fast message dissemination in random geometric networks ⋮ Broadcasting in UDG radio networks with missing and inaccurate information ⋮ Broadcasting in UDG radio networks with unknown topology ⋮ Time efficient centralized gossiping in radio networks ⋮ Time efficient \(k\)-shot broadcasting in known topology radio networks ⋮ Fast Radio Broadcasting with Advice ⋮ Almost optimal distributed M2M multicasting in wireless mesh networks ⋮ Latency-optimal communication in wireless mesh networks ⋮ Optimal deterministic broadcasting in known topology radio networks ⋮ Faster communication in known topology radio networks ⋮ Activating anonymous ad hoc radio networks ⋮ Broadcasting in geometric radio networks ⋮ Broadcasting in UDG Radio Networks with Missing and Inaccurate Information ⋮ Fast radio broadcasting with advice ⋮ Improved lower bound for deterministic broadcasting in radio networks ⋮ Acknowledged broadcasting in ad hoc radio networks ⋮ Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks ⋮ Radio communication in random graphs ⋮ Deterministic M2M multicast in radio networks ⋮ Efficient \(k\)-shot broadcasting in radio networks ⋮ On the effect of the deployment setting on broadcasting in Euclidean radio networks ⋮ Faster deterministic communication in radio networks ⋮ Many-to-many communication in radio networks ⋮ A note on the lower bound of centralized radio broadcasting for planar reachability graphs ⋮ Time-Efficient Broadcast in Radio Networks

This page was built for publication: