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 |