𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some minimum broadcast graphs

✍ Scribed by M. Mahéo; J.-F. Saclé

Book ID
118389369
Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
620 KB
Volume
53
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum broadcast graphs
Minimum broadcast graphs
✍ Arthur Farley; Stephen Hedetniemi; Sandra Mitchell; Andrzej Proskurowski 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 490 KB
Minimum k-broadcast graphs
Minimum k-broadcast graphs
✍ J.-C. König; E. Lazard 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 647 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

Some minimum gossip graphs
Some minimum gossip graphs
✍ Roger Labahn 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 715 KB