Derandomizing algorithms for perfect target set selection
碩士 === 元智大學 === 資訊工程學系 === 100 === In this paper, let G(V,E) be a simple undirected graph, with only two possible states for each vertex: Active or inactive. Only a set S of vertices are activated initially. Thereafter, an inactive vertex is activated when at least α fraction of its neighbors are ac...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Online Access: | http://ndltd.ncl.edu.tw/handle/44083440679520698047 |