Multiple message broadcasting in communication networks

DOI10.1002/NET.3230260409zbMath0856.90048OpenAlexW2138489200MaRDI QIDQ4894862

Oh-Heum Kwon, Kyung-Yong Chwa

Publication date: 7 October 1996

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230260409

zbMATH Keywords

broadcastingminimal broadcast graphs

Mathematics Subject Classification ID

Communication networks in operations research (90B18)

Related Items (6)

Optimal scheduling of peer-to-peer file dissemination ⋮ Broadcasting a file in a communication network ⋮ Optimal broadcast for fully connected processor-node networks ⋮ Optimal multiple message broadcasting in telephone-like communication systems ⋮ New upper bound on \(m\)-time-relaxed \(k\)-broadcast graphs ⋮ Sparse hypercube -- a minimal \(k\)-line broadcast graph.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Multiple message broadcasting in communication networks