Hamiltonian properties of honeycomb meshes
Authors:
- Dacheng XuDXDacheng Xu
- Jianxi FanJFJianxi Fan
- Xiaohua JiaXJXiaohua Jia
- Shukui ZhangSZShukui Zhang
- Xi WangXWXi Wang
- 1 August 2013
- journal article
- research article
- Published by Elsevier in Information Sciences
- Vol. 240, 184-190
Abstract
No abstract availableKeywords
This publication has 39 references indexed in Scilit:
- A Reliable Routing Architecture and Algorithm for NoCsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2012
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edgesTheoretical Computer Science, 2011
- Conditional edge-fault-tolerant Hamiltonicity of dual-cubesInformation Sciences, 2011
- A generic adaptive path-based routing method for MPSoCsJournal of Systems Architecture, 2011
- Embedding a fault-free hamiltonian cycle in a class of faulty generalized honeycomb toriComputers and Electrical Engineering, 2009
- Edge-pancyclicity and path-embeddability of bijective connection graphsInformation Sciences, 2008
- A survey of research and practices of Network-on-chipACM Computing Surveys, 2006
- Generalized honeycomb torusInformation Processing Letters, 2003
- Ring embedding in faulty honeycomb rectangular torusInformation Processing Letters, 2002
- An efficient algorithm for constructing Hamiltonian paths in meshesParallel Computing, 2002