Optimal and near-optimal broadcast in random graphs

DOI10.1016/0166-218X(89)90007-3zbMath0709.05031OpenAlexW2028402123MaRDI QIDQ921019

Edward R. Scheinerman, John C. Wierman

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0166-218x(89)90007-3

zbMATH Keywords

random graphbroadcast number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (9)

Fast gossiping with short unreliable messages ⋮ Close-to-optimal and near-optimal broadcasting in random graphs ⋮ Broadcasting with linearly bounded transmission faults ⋮ Token transfer in a faulty network ⋮ Sparse networks supporting efficient reliable broadcasting ⋮ Broadcasting in complete networks with faulty nodes using unreliable calls ⋮ Broadcasting in random graphs ⋮ Reliable Broadcasting in Hypercubes with Random Link and Node Failures ⋮ Broadcasting in random graphs

Cites Work

• Graphs and matching theorems
• Minimum broadcast graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal and near-optimal broadcast in random graphs