Covering Problems in Graphs
博士 === 國立臺灣大學 === 數學研究所 === 102 === Covering problems in graphs are optimization problems about covering the vertex set V(G) or the edge set E(G) of a graph G under some additional restrictions. In other words, a emph{graph covering} of G is a collection of vertex/edge subsets of G such that each ve...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2014
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/16999152570419494427 |