Target Set Selection Problem on Paths and Grids
碩士 === 國立中央大學 === 數學系 === 102 === In this paper, we are focus on the Target set Selection Problem (TSS Problem) on path. We also get some results on Pn□Pm. Consider two different rules of Bootstrap Percolation: Rule I and Rule II Under Rule I, we generalize Theorem 1, Theorem 2 and Theorem 3 ([3], [...
Main Authors: | Han-wun Guo, 郭瀚文 |
---|---|
Other Authors: | Hong-Gwa Yeh |
Format: | Others |
Language: | zh-TW |
Published: |
2014
|
Online Access: | http://ndltd.ncl.edu.tw/handle/14870951425581855153 |
Similar Items
-
Target Set Selection Problem on Hypercubes and Grids
by: Yi-Jia Hsiao, et al.
Published: (2015) -
On the target set selection problem
by: Chun-ying Chiang, et al.
Published: (2012) -
A Document Clustering Method Based on Ontology Structure and Semantic Concepts
by: Han-Wun Kuo, et al.
Published: (2008) -
Selecting sufficient sets of test paths for program testing /
by: Zeil, Steven Joseph,
Published: (1981) -
The Longest Path Problem on Distance-hereditary Graphs
by: Yi-Lu Guo, et al.
Published: (2013)