Solving the Paired-Dominating Set Problem on Graphs by DNA Computing
碩士 === 國立臺灣大學 === 資訊網路與多媒體研究所 === 106 === In this thesis, we apply DNA computing technic to solve the paired-dominating set problem on graphs and the graphs we discussed in this thesis are all undirected and non-cyclic and with limited vertex number. V(G) is the vertex set of graph G = (V, E). A dom...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2018
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/cuu369 |