A Study of ωWeak Dimension-Balanced Cycle Problems on Toroidal Mesh Graphs
碩士 === 國立暨南國際大學 === 資訊工程學系 === 107 === G = (V, E) is a graph which edge set E is partitioned into k dimensions for a positive integer k. Given a cycle C on G, the set of all i-dimensional edge of C, a subset of E(G), is denoted by E_i(C) for 1 \leq i ≤ k. If ||E_i(C)| - |E_j(C)|| ≤ 1 (3 or 2ω + 1, r...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2019
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/5sv689 |