A Study of Node Search Spanning Tree Problem On Unicyclic Graph
碩士 === 國立東華大學 === 資訊工程學系 === 105 === The node searching problem on a graph G is to determine the minimum number of searchers to clear G via rules of node searching. This minimum number is called the node-search number of G. The node searching spanning tree problem on graph G is to find a spanning tr...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Published: |
2017
|
Online Access: | http://ndltd.ncl.edu.tw/handle/2hyew2 |
id |
ndltd-TW-105NDHU5392002 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-105NDHU53920022019-05-15T23:17:01Z http://ndltd.ncl.edu.tw/handle/2hyew2 A Study of Node Search Spanning Tree Problem On Unicyclic Graph 點搜尋生成樹問題在單迴圈圖上之研究 Shang-Yi Yang 楊上逸 碩士 國立東華大學 資訊工程學系 105 The node searching problem on a graph G is to determine the minimum number of searchers to clear G via rules of node searching. This minimum number is called the node-search number of G. The node searching spanning tree problem on graph G is to find a spanning tree T of G such that the node-search number of T is the minimum among all possible spanning trees of G. In this thesis, we study the node searching spanning tree problem on unicyclic graphs. A unicyclic graph is a tree with an additional edge. That is, a unicyclic graph contains only one cycle. It is known that the node searching problem on trees can be solved in O(n) time, where n is the number of vertices in the tree. Thus, a straightforward algorithm for solving the node searching spanning tree problem on unicyclic graphs runs in O(n2) time. In this study, we present a linear-time algorithm for solving the node searching spanning tree problem on unicyclic graphs. Sheng-Lung Peng 彭勝龍 2017 學位論文 ; thesis 69 |
collection |
NDLTD |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 國立東華大學 === 資訊工程學系 === 105 === The node searching problem on a graph G is to determine the minimum number of searchers to clear G via rules of node searching. This minimum number is called the node-search number of G. The node searching spanning tree problem on graph G is to find a spanning tree T of G such that the node-search number of T is the minimum among all possible spanning trees of G. In this thesis, we study the node searching spanning tree problem on unicyclic graphs. A unicyclic graph is a tree with an additional edge. That is, a unicyclic graph contains only one cycle. It is known that the node searching problem on trees can be solved in O(n) time, where n is the number of vertices in the tree. Thus, a straightforward algorithm for solving the node searching spanning tree problem on unicyclic graphs runs in O(n2) time. In this study, we present a linear-time algorithm for solving the node searching spanning tree problem on unicyclic graphs.
|
author2 |
Sheng-Lung Peng |
author_facet |
Sheng-Lung Peng Shang-Yi Yang 楊上逸 |
author |
Shang-Yi Yang 楊上逸 |
spellingShingle |
Shang-Yi Yang 楊上逸 A Study of Node Search Spanning Tree Problem On Unicyclic Graph |
author_sort |
Shang-Yi Yang |
title |
A Study of Node Search Spanning Tree Problem On Unicyclic Graph |
title_short |
A Study of Node Search Spanning Tree Problem On Unicyclic Graph |
title_full |
A Study of Node Search Spanning Tree Problem On Unicyclic Graph |
title_fullStr |
A Study of Node Search Spanning Tree Problem On Unicyclic Graph |
title_full_unstemmed |
A Study of Node Search Spanning Tree Problem On Unicyclic Graph |
title_sort |
study of node search spanning tree problem on unicyclic graph |
publishDate |
2017 |
url |
http://ndltd.ncl.edu.tw/handle/2hyew2 |
work_keys_str_mv |
AT shangyiyang astudyofnodesearchspanningtreeproblemonunicyclicgraph AT yángshàngyì astudyofnodesearchspanningtreeproblemonunicyclicgraph AT shangyiyang diǎnsōuxúnshēngchéngshùwèntízàidānhuíquāntúshàngzhīyánjiū AT yángshàngyì diǎnsōuxúnshēngchéngshùwèntízàidānhuíquāntúshàngzhīyánjiū AT shangyiyang studyofnodesearchspanningtreeproblemonunicyclicgraph AT yángshàngyì studyofnodesearchspanningtreeproblemonunicyclicgraph |
_version_ |
1719143582511661056 |