Generalized Broadcasting Problem of Graphs
碩士 === 國立東華大學 === 應用數學系 === 94 === For a given graph G, suppose S is a set of V (G) which satisfies the following conditions: (1) each vertex v in S owns a single message, (2) different vertices in S owns different messages, (3) every vertex not in S does not own any message, we want to find the min...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/07482394713819836816 |