Multi-Messages,Multi-Originators Broadcasting in Graph
碩士 === 國立東華大學 === 應用數學系 === 91 === Given a graph and a vertex v belong to V (G) who knows a message s. Suppose we want to give a series of calls to transmit the message to all the vertices in G with the following constraints : (1) u can transmit the message s to w only if u knows the messa...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/89131213612677512052 |