𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimum broadcast graphs

✍ Scribed by Arthur Farley; Stephen Hedetniemi; Sandra Mitchell; Andrzej Proskurowski

Book ID
107748290
Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
490 KB
Volume
25
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Minimum k-broadcast graphs
Minimum k-broadcast graphs
✍ J.-C. KΓΆnig; E. Lazard πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 647 KB
Some minimum broadcast graphs
Some minimum broadcast graphs
✍ M. MahΓ©o; J.-F. SaclΓ© πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 620 KB
Minimum multiple message broadcast graph
Minimum multiple message broadcast graphs
✍ Hovhannes A. Harutyunyan πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 207 KB

Multiple message broadcasting is the process of multiple message dissemination in a communication network in which m messages, originated by one vertex, are transmitted to all vertices of the network. A graph G with n vertices is called a m-message broadcast graph if its broadcast time is the theore

A minimum broadcast graph on 26 vertices
A minimum broadcast graph on 26 vertices
✍ Jian-guo Zhou; Ke-min Zhang πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 246 KB

Broadcasting is the process of information dissemination in a communication network in which a message, originated by one member, is transmitted to all members of the network. A broadcast graph is a graph which permits broadcasting from any originator in minimum time. The broadcast function B(n) is