A Study of Dimension-Balanced Hamiltonian Cycle on 3-Dimensional Toroidal Mesh Graphs
碩士 === 國立暨南國際大學 === 資訊工程學系 === 107 === The dimension-balanced cycle (DBC for short) problem is a quite new topic in graph theory. It is developed from the problem of 3D stereogram reconstruction. For a graph G, let the edge sets of G be partitioned into k dimensions, that is, E(G) = E1(G) ∪ . ....
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2019
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/mmhg3h |