A general upper bound on broadcast function B(n) using Knodel graph
Broadcasting in a graph is the process of transmitting a message from one vertex, the originator, to all other vertices of the graph. We will consider the classical model in which an informed vertex can only inform one of its uninformed neighbours during each time unit. A broadcast graph on n vertic...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
2013
|
| Online Access: | http://spectrum.library.concordia.ca/977799/1/Altay_MSc_F2013.pdf Altay, Sirma Cagil <http://spectrum.library.concordia.ca/view/creators/Altay=3ASirma_Cagil=3A=3A.html> (2013) A general upper bound on broadcast function B(n) using Knodel graph. Masters thesis, Concordia University. |