On the target set selection problem
博士 === 國立中央大學 === 數學研究所 === 100 === In this thesis, We are interested in the target set selection problem on different kinds of graphs. In Chapter 2, we show that if G is a block-cactus graph with general thresholds, then the TARGET SET SELECTION problem can be solved in linear time. When G is a cho...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2012
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/35279405604568816449 |