The Node-Searching Problem on Block Graphs and Unicyclic Graphs
博士 === 國立臺灣大學 === 資訊工程學研究所 === 92 === The node-searching problem, introduced by Kirousis and Papadimitriou, is a variant of the graph-searching problem. The allowable search moves in the node-searching problem are as follows: (1) placing a searcher on a vertex, and (2) removing a searcher from a ver...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/64866009754895218221 |