Cycle Cover of Graphs
碩士 === 國立交通大學 === 應用數學系所 === 96 === A cycle cover of a graph G is a collection of cycles of G which covers all edges of G. The size of a cycle cover is the sum of the lengths of the cycles in the cover. A flow in G under orientation D is an integer-valued function on E(G) such that the output value...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2008
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/7za764 |