Close-to-optimal and near-optimal broadcasting in random graphs

DOI10.1016/0166-218X(95)00004-BzbMath0833.94027MaRDI QIDQ1902897

Alexandros V. Gerbessiotis

Publication date: 12 March 1996

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

zbMATH Keywords

broadcasting in random graphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Communication networks in operations research (90B18) Combinatorial probability (60C05) Applications of graph theory to circuits and networks (94C15)

Related Items (3)

The total acquisition number of random graphs ⋮ The total acquisition number of random geometric graphs ⋮ The unit acquisition number of binomial random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal and near-optimal broadcast in random graphs
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• A dense infinite Sidon sequence
• Broadcasting in random graphs

This page was built for publication: Close-to-optimal and near-optimal broadcasting in random graphs