Embedding Mesh into Recursive Circulant Graph
碩士 === 南台科技大學 === 資訊管理系 === 92 === In these years, many efficient parallel algorithms have been designed for interconnection networks to solve all kind of problems. Among them, the embedding problems have received much attention. Embedding can help us to easily apply an algorithm that is designed on...
Main Authors: | Shan-Chan Yu, 余善謙 |
---|---|
Other Authors: | Hui-Ling Huang |
Format: | Others |
Language: | zh-TW |
Published: |
2004
|
Online Access: | http://ndltd.ncl.edu.tw/handle/81174069497659401308 |
Similar Items
-
The Embedding Three-Dimensional Mesh into the Recursive Circulant Graph
by: Weng,Shih-Hsuan, et al.
Published: (101) -
Embedding in recursive circulant graph
by: Chen, Guan Hua, et al.
Published: (1996) -
Hamiltonian Decompositions of Recursive Circulant Graphs
by: Y-Chuang Chen, et al.
Published: (2000) -
Independent Spanning Trees on Recursive Circulant Graphs
by: MengYu-Lin, et al.
Published: (2003) -
Fault-Tolerant Pancyclicity of Recursive Circulant Graphs
by: Fei-Wen Cheng, et al.
Published: (2003)