A Study on the Terminal Path Cover Problem
碩士 === 朝陽科技大學 === 資訊工程系碩士班 === 97 === Let G = (V,E) be a graph with vertex set V and edge set E and let T be a subset of V. A terminal path cover PC of G with respect to T is a set of pairwise vertex-disjoint paths of G which cover the vertices of G such that all vertices in T are end vertices of pa...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/29148072477624251432 |