Name
Abstract | ||
|---|---|---|
Meshes are widely used topologies for Networks on Chip (NoC). Honeycomb meshes have better topological properties than Meshes. In order to communicate efficiently in a linear or cyclic manner, it is benefited that there is a Hamiltonian path or Hamiltonian cycle in NoC. In this paper, we give a necessary and sufficient condition for the existence of Hamiltonian path between any pair of vertices in a honeycomb mesh and for the existence of Hamiltonian path in a honeycomb mesh with one faulty vertex. Besides, we give a systematic method to construct a Hamiltonian path in Honeycomb meshes. © 2013 Elsevier Inc. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1016/j.ins.2013.03.044 | Information Sciences |
Keywords | Field | DocType |
Hamiltonian path,Honeycomb mesh,NoC | Topology,Discrete mathematics,Polygon mesh,Hamiltonian (quantum mechanics),Vertex (geometry),Hamiltonian path,Honeycomb,Network topology,Mathematics | Journal |
Volume | ISSN | Citations |
240 | 00200255 | 3 |
PageRank | References | Authors |
0.39 | 39 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xu Dacheng | 1 | 3 | 0.39 |
| Jianxi Fan | 2 | 718 | 60.15 |
| Xiaohua Jia | 3 | 4609 | 303.30 |
| Zhang Shukui | 4 | 39 | 1.53 |
| Xi Wang | 5 | 85 | 6.56 |