Embedding Cycles and Paths into k-Ary N-Cubes
博士 === 國立成功大學 === 資訊工程學系碩博士班 === 97 === For interconnection networks, the problem of simulating one network by another is modelled as a network embedding problem. For finding a cycle (path) of given length, has received a great deal of attention in recent years because the cycle (path) is the most f...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/00306705618350511932 |