Algorithms for the connected hub numbers on some special graphs
碩士 === 世新大學 === 資訊管理學研究所(含碩專班) === 101 === A hub set of a graph G(V, E) is a subset H of V such that for any two distinct vertices u, v do not belong to H, if (u, v) do not belong to E, then they are connected by a path in H. If <H> is connected, then H is called a connected hub set of G, whe...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | en_US |
Published: |
2013
|
Online Access: | http://ndltd.ncl.edu.tw/handle/63181059128700971351 |
id |
ndltd-TW-101SHU05396057 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-101SHU053960572016-12-19T04:14:25Z http://ndltd.ncl.edu.tw/handle/63181059128700971351 Algorithms for the connected hub numbers on some special graphs 在一些特殊圖上數連通中繼站點數之演算法 Chih-Yuan Lin 林志遠 碩士 世新大學 資訊管理學研究所(含碩專班) 101 A hub set of a graph G(V, E) is a subset H of V such that for any two distinct vertices u, v do not belong to H, if (u, v) do not belong to E, then they are connected by a path in H. If <H> is connected, then H is called a connected hub set of G, where <H> represents the subgraph of G induced by the vertices in H. The problem of finding a minimum connected hub set, called the Minimum Connected Hub Set problem (the MCHS problem) is studied in this thesis. We prove that the MCHS problem is NP-hard on split graphs with special constraint and propose linear-time algorithms for on some special graphs. The classes of graphs studied include block-cactus graphs, convex-split graphs, and biconvex-bipartite graphs. Chung-kung Yen 顏重功 2013 學位論文 ; thesis 31 en_US |
collection |
NDLTD |
language |
en_US |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 世新大學 === 資訊管理學研究所(含碩專班) === 101 === A hub set of a graph G(V, E) is a subset H of V such that for any two distinct vertices u, v do not belong to H, if (u, v) do not belong to E, then they are connected by a path in H. If <H> is connected, then H is called a connected hub set of G, where <H> represents the subgraph of G induced by the vertices in H. The problem of finding a minimum connected hub set, called the Minimum Connected Hub Set problem (the MCHS problem) is studied in this thesis. We prove that the MCHS problem is NP-hard on split graphs with special constraint and propose linear-time algorithms for on some special graphs. The classes of graphs studied include block-cactus graphs, convex-split graphs, and biconvex-bipartite graphs.
|
author2 |
Chung-kung Yen |
author_facet |
Chung-kung Yen Chih-Yuan Lin 林志遠 |
author |
Chih-Yuan Lin 林志遠 |
spellingShingle |
Chih-Yuan Lin 林志遠 Algorithms for the connected hub numbers on some special graphs |
author_sort |
Chih-Yuan Lin |
title |
Algorithms for the connected hub numbers on some special graphs |
title_short |
Algorithms for the connected hub numbers on some special graphs |
title_full |
Algorithms for the connected hub numbers on some special graphs |
title_fullStr |
Algorithms for the connected hub numbers on some special graphs |
title_full_unstemmed |
Algorithms for the connected hub numbers on some special graphs |
title_sort |
algorithms for the connected hub numbers on some special graphs |
publishDate |
2013 |
url |
http://ndltd.ncl.edu.tw/handle/63181059128700971351 |
work_keys_str_mv |
AT chihyuanlin algorithmsfortheconnectedhubnumbersonsomespecialgraphs AT línzhìyuǎn algorithmsfortheconnectedhubnumbersonsomespecialgraphs AT chihyuanlin zàiyīxiētèshūtúshàngshùliántōngzhōngjìzhàndiǎnshùzhīyǎnsuànfǎ AT línzhìyuǎn zàiyīxiētèshūtúshàngshùliántōngzhōngjìzhàndiǎnshùzhīyǎnsuànfǎ |
_version_ |
1718401009094492160 |